Hash problems

18 Hash DSA practice problems on CampusCode, each with statement, examples and constraints.

• 377. Remove Zero-Sum Consecutive Nodes Medium Linked List
• 399. Remove Duplicates from an Unsorted Linked List in O(n) Hard Linked List
• 412. Find All Anagrams via Sliding Window Hard Linked List
• 414. Partition Linked List into K Consecutive Groups Hard Linked List
• 539. Minimum Window Containing All Required Elements Hard Binary Search
• 854. Top View of Binary Tree Easy Trees
• 855. Bottom View of Binary Tree Easy Trees
• 858. Vertical Order Traversal Easy Trees
• 896. Construct Binary Tree from Preorder and Inorder Medium Trees
• 897. Construct Binary Tree from Postorder and Inorder Medium Trees
• 906. Find Duplicate Subtrees Medium Trees
• 928. Count Words with Given Prefix in Trie Medium Trees
• 929. Longest Word in Dictionary (Trie) Medium Trees
• 930. Replace Words Using Trie (Sentence Shortening) Medium Trees
• 948. Palindrome Pairs (Trie Approach) Hard Trees
• 966. Find Duplicate Subtrees (Hashing) Hard Trees
• 972. Check if Edge Exists in Graph Easy Graphs
• 1008. Check if Path Crosses Itself Easy Graphs