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