Hash Table
65 solutions
- 0001 - Two Sum (Easy)
- 0003 - Longest Substring Without Repeating Characters (Medium)
- 0012 - Integer to Roman (Medium)
- 0017 - Letter Combinations of a Phone Number (Medium)
- 0049 - Group Anagrams (Medium)
- 0073 - Set Matrix Zeroes (Medium)
- 0105 - Construct Binary Tree from Preorder and Inorder Traversal (Medium)
- 0127 - Word Ladder (Hard)
- 0133 - Clone Graph (Medium)
- 0138 - Copy List with Random Pointer (Medium)
- 0139 - Word Break (Medium)
- 0141 - Linked List Cycle (Easy)
- 0146 - LRU Cache (Medium)
- 0205 - Isomorphic Strings (Easy)
- 0208 - Implement Trie (Prefix Tree) (Medium)
- 0242 - Valid Anagram (Easy)
- 0268 - Missing Number (Easy)
- 0290 - Word Pattern (Easy)
- 0350 - Intersection of Two Arrays II (Easy)
- 0355 - Design Twitter (Medium)
- 0383 - Ransom Note (Easy)
- 0387 - First Unique Character in a String (Easy)
- 0389 - Find the Difference (Easy)
- 0424 - Longest Repeating Character Replacement (Medium)
- 0433 - Minimum Genetic Mutation (Medium)
- 0438 - Find All Anagrams in a String (Medium)
- 0451 - Sort Characters By Frequency (Medium)
- 0491 - Non-decreasing Subsequences (Medium)
- 0508 - Most Frequent Subtree Sum (Medium)
- 0525 - Contiguous Array (Medium)
- 0567 - Permutation in String (Medium)
- 0609 - Find Duplicate File in System (Medium)
- 0621 - Task Scheduler (Medium)
- 0645 - Set Mismatch (Easy)
- 0653 - Two Sum IV - Input is a BST (Easy)
- 0763 - Partition Labels (Medium)
- 0846 - Hand of Straights (Medium)
- 0904 - Fruit Into Baskets (Medium)
- 0974 - Subarray Sums Divisible by K (Medium)
- 0987 - Vertical Order Traversal of a Binary Tree (Hard)
- 0992 - Subarrays with K Different Integers (Hard)
- 0997 - Find the Town Judge (Easy)
- 1347 - Minimum Number of Steps to Make Two Strings Anagram (Easy)
- 1386 - Cinema Seat Allocation (Medium)
- 1460 - Make Two Arrays Equal by Reversing Subarrays (Easy)
- 1496 - Path Crossing (Easy)
- 1519 - Number of Nodes in the Sub-Tree With the Same Label (Medium)
- 1590 - Make Sum Divisible by P (Medium)
- 1624 - Largest Substring Between Two Equal Characters (Easy)
- 1657 - Determine If Two Strings Are Close (Medium)
- 2007 - Find Original Array From Doubled Array (Medium)
- 2013 - Detect Squares (Medium)
- 2131 - Longest Palindrome by Concatenating Two Letter Words (Medium)
- 2225 - Find Players With Zero or One Losses (Medium)
- 2251 - Number of Flowers in Full Bloom (Hard)
- 2461 - Maximum Sum of Distinct Subarrays With Length K (Medium)
- 2501 - Longest Square Streak in an Array (Medium)
- 2610 - Convert an Array Into a 2D Array With Conditions (Medium)
- 2815 - Max Pair Sum in an Array (Easy)
- 3005 - Count Elements With Maximum Frequency (Easy)
- 3090 - Maximum Length Substring With Two Occurrences (Easy)
- 3238 - Find the Number of Winning Players (Easy)
- 3289 - The Two Sneaky Numbers of Digitville (Easy)
- 3471 - Find the Largest Almost Missing Integer (Easy)
- 3718 - Smallest Missing Multiple of K (Easy)