A collection of LeetCode problems solved using Hash Map pattern techniques, explanations, and complexity analysis.
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 1 | Two Sum | Python | O(n) | O(n) | Explanation |
| 58 | Length of Last Word | Python | O(n) | O(n) | Explanation |
| 242 | Valid Anagram | PHP | O(n) | O(n) | Explanation |
| 290 | Word Pattern | C++ | O(n) | O(n) | Explanation |
| 405 | Convert a Number to Hexadecimal | Python | O(n) | O(n) | Explanation |
| 476 | Number Complement | Python | O(n) | O(n) | Explanation |
| 504 | Base 7 | Python | O(n) | O(n) | Explanation |
| 697 | Degree of an Array | Python | O(n) | O(n) | Explanation |
| 705 | Design HashSet | Python | O(n) | O(n) | Explanation |
| 706 | Design HashMap | Python | O(n) | O(n) | Explanation |
| 748 | Shortest Completing Word | Python | O(n) | O(n) | Explanation |
| 905 | Sort Array By Parity | Python | O(n) | O(n) | Explanation |
| 953 | Verifying an Alien Dictionary | Python | O(n) | O(n) | Explanation |
| 1009 | Complement of Base 10 Integer | Python | O(n) | O(n) | Explanation |
| 1114 | Print in Order | Java | O(n) | O(n) | Explanation |
| 1122 | Relative Sort Array | Python | O(n) | O(n) | Explanation |
| 1189 | Maximum Number of Balloons | Kotlin | O(n) | O(n) | Explanation |
| 1394 | Find Lucky Integer in an Array | Python | O(n) | O(n) | Explanation |
| 1566 | Detect Pattern of Length M Repeated K or More Times | Python | O(n) | O(n) | Explanation |
| 1636 | Sort Array by Increasing Frequency | C++ | O(n) | O(n) | Explanation |
| 1827 | Minimum Operations to Make the Array Increasing | C++ | O(n) | O(n) | Explanation |
| 1941 | Check if All Characters Have Equal Number of Occurrences | C++ | O(n) | O(n) | Explanation |
| 2635 | Apply Transform Over Each Element in Array | TypeScript | O(n) | O(n) | Explanation |
| 2703 | Return Length of Arguments Passed | TypeScript | O(n) | O(n) | Explanation |
| 2726 | Calculator with Method Chaining | TypeScript | O(n) | O(n) | Explanation |
| 2891 | Method Chaining | Python | O(n) | O(n) | Explanation |
| 3014 | Minimum Number of Pushes to Type Word I | Dart | O(n) | O(n) | Explanation |
| 3069 | Distribute Elements Into Two Arrays I | Go | O(n) | O(n) | Explanation |
| 3838 | Weighted Word Mapping | Kotlin | O(n) | O(n) | Explanation |
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 49 | Group Anagrams | Python | O(n) | O(n) | Explanation |
| 192 | Word Frequency | Shell | O(n) | O(n) | Explanation |
| 1115 | Print FooBar Alternately | Java | O(n) | O(n) | Explanation |
| 1386 | Cinema Seat Allocation | C++ | O(n) | O(n) | Explanation |
| 1674 | Minimum Moves to Make Array Complementary | C++ | O(n) | O(n) | Explanation |
| 1807 | Evaluate the Bracket Pairs of a String | C++ | O(n) | O(n) | Explanation |
| 2622 | Cache With Time Limit | JavaScript | O(n) | O(n) | Explanation |
| 2722 | Join Two Arrays by ID | TypeScript | O(n) | O(n) | Explanation |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | C++ | O(n) | O(n) | Explanation |
| 2958 | Length of Longest Subarray With at Most K Frequency | C++ | O(n) | O(n) | Explanation |
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 1345 | Jump Game IV | C++ | O(n) | O(n) | Explanation |
| 2630 | Memoize II | TypeScript | O(n) | O(n) | Explanation |
| 3093 | Longest Common Suffix Queries | Python | O(n) | O(n) | Explanation |
| 3699 | Number of ZigZag Arrays I | PHP | O(n) | O(n) | Explanation |