Hash Table Problems
Hash tables provide O(1) average lookup, making them the go-to for frequency counting, duplicate detection, and two-sum style problems. These problems train you to think in terms of key-value mappings.
18 problems
| Title | Difficulty | Platform |
|---|---|---|
| Basic Calculator II | Medium | LeetCode |
| Boyer Moore Algorithm for Pattern Searching | Hard | GeeksforGeeks |
| Distinct Subsequences | Hard | LeetCode |
| Find the Index of the First Occurrence in a String | Easy | LeetCode |
| Generate Parentheses | Medium | LeetCode |
| Integer to English Words | Hard | LeetCode |
| Integer to Roman | Medium | LeetCode |
| Longest Common Prefix | Easy | LeetCode |
| Longest Happy Prefix | Hard | LeetCode |
| Minimum Window Substring | Hard | LeetCode |
| Print all the duplicate characters in a string | Easy | GeeksforGeeks |
| Reverse Words in a String | Medium | LeetCode |
| Simplify Path | Medium | LeetCode |
| Text Justification | Hard | LeetCode |
| Two Sum | Easy | LeetCode |
| Valid Number | Hard | LeetCode |
| Valid Palindrome II | Easy | LeetCode |
| Valid Parentheses | Easy | LeetCode |