Data Structures: Problems#
Pick a data structure and drill problems tagged with it.
- Array (32)
- Bits (5)
- Graph (7)
- Hash Table (11)
- Heap (3)
- Linkedlist (5)
- Stack (3)
- String (18)
- Tree (12)
- Trie (3)
Array
- Best time to buy and sell stock
- Bigram Model - Next Word Prediction
- Combination sum IV
- Construct binary tree from preorder and inorder traversal
- Container with most water
- Contains duplicate
- Count Distinct Subsequences
- Counting bits
- Find minimum in rotated sorted array
- House robber
- House robber II
- Insert interval
- Jump game
- Longest consecutive sequence
- Longest increasing subsequence
- Maximum product subarray
- Maximum subarray
- Meeting rooms
- Meeting rooms II
- Merge intervals
- Missing number
- Non overlapping intervals
- Product of array except self
- Rotate image
- Search in rotated sorted array
- SET Card Game - Validate Set And Find Set
- Set matrix zeroes
- Spiral matrix
- Three sum
- Two sum
- Unique paths
- Word search
Bits
Graph
- Alien dictionary
- Clone graph
- Course schedule
- Graph valid tree
- Number of connected components in an undirected graph
- Number of islands
- Pacific-Atlantic water flow
Hash Table
- Bigram Model - Next Word Prediction
- Contains duplicate
- Group anagrams
- Longest substring without repeating characters
- Minimum window substring
- SET Card Game - Validate Set And Find Set
- Three sum
- Top k frequent elements
- Two sum
- Valid anagram
- Verify Lexicographic Sort With Custom Alphabet
Heap
Linkedlist
- Linked list cycle
- Merge k sorted lists
- Remove n'th node from end of list
- Reorder list
- Reverse linked list
Stack
- Evaluate Precedence Expression With + And *
- Minimum Remove To Make Parentheses Valid
- Valid parentheses
String
- Bigram Model - Next Word Prediction
- Count Distinct Subsequences
- Decode ways
- Encode and decode strings
- Evaluate Precedence Expression With + And *
- Group anagrams
- Is Subsequence
- Longest palindromic substring
- Longest repeating character replacement
- Longest substring without repeating characters
- Minimum Remove To Make Parentheses Valid
- Minimum window substring
- Palindromic substrings
- Valid anagram
- Valid palindrome
- Valid parentheses
- Verify Lexicographic Sort With Custom Alphabet
- Word break
Tree
- Binary tree level order traversal
- Binary tree maximum path sum
- Construct binary tree from preorder and inorder traversal
- Insert Into Complete Binary Tree (Level-Order)
- Invert a binary tree
- Kth smallest element in a BST
- Lowest common ancestor of a binary search tree
- Maximum depth of binary tree
- Same tree
- Serialize and deserialize a binary tree
- Subtree of another tree
- Validate a binary search tree