Topic: Hashing-question / Level: Beginner

• 1. Implement a hash function that takes a string and returns a hash value.
• 2. Create a hash table with basic operations: insert, delete, and search.
• 3. Write a program to check for duplicates in an array using hashing.
• 4. Implement a function to count the frequency of elements in an array using a hash map.
• 5. Given two strings, write a program to check if they are anagrams using hashing.
• 6. Create a hash map that maps characters to their counts in a string.
• 7. Write a function to find the first non-repeating character in a string using hashing.
• 8. Implement a hash set that supports add, remove, and contains operations.
• 9. Create a program to find the intersection of two arrays using hashing.
• 10. Write a function to group anagrams from a list of strings using a hash map.
• 11. Implement a function to check if two strings are rotations of each other using hashing.
• 12. Create a hash table that supports collisions using chaining.
• 13. Write a program to find the longest substring without repeating characters using hashing.
• 14. Implement a function to find all pairs in an array that sum to a target using hashing.
• 15. Create a hash map to track the positions of elements in an array.
• 16. Write a program to find all unique elements in an array using hashing.
• 17. Implement a function to find the maximum frequency element in an array using hashing.
• 18. Create a hash table to store a mapping of student IDs to names.
• 19. Write a function to count the occurrences of a specific character in a string using hashing.
• 20. Implement a hash function for integers that ensures a uniform distribution.
• 21. Create a hash map to store word definitions and retrieve them by word.
• 22. Write a program to find the longest common prefix among an array of strings using hashing.
• 23. Implement a function to remove duplicates from a sorted array using hashing.
• 24. Create a hash table that maps words to their lengths from a given list.
• 25. Write a program to find the two numbers that add up to a given target from an array using hashing.
• 26. Implement a function to check if a string contains all unique characters using hashing.
• 27. Create a hash set to keep track of visited nodes in a graph.
• 28. Write a program to find the maximum product of two distinct elements in an array using hashing.
• 29. Implement a function to count the number of distinct substrings in a string using hashing.
• 30. Create a hash map to store the scores of players in a game.

• More Levels

• Intermediate
• Advanced