Algorithms: Problems#
Approach problems by core Algorithms / techniques (DP/DFS/BFS/etc.).
- Bfs (5)
- Binary Search (4)
- Dfs (9)
- Divide and Conquer (2)
- Dynamic Programming (14)
- Greedy (1)
Bfs
- Binary tree level order traversal
- Clone graph
- Course schedule
- Number of islands
- Pacific-Atlantic water flow
Binary Search
- Find minimum in rotated sorted array
- Kth smallest element in a BST
- Longest increasing subsequence
- Search in rotated sorted array
Dfs
- Binary tree maximum path sum
- Clone graph
- Construct binary tree from preorder and inorder traversal
- Course schedule
- Maximum depth of binary tree
- Number of islands
- Pacific-Atlantic water flow
- Same tree
- Validate a binary search tree
Divide and Conquer
Dynamic Programming
- Climbing stairs
- Coin change
- Combination sum IV
- Counting bits
- Decode ways
- House robber
- House robber II
- Jump game
- Longest increasing subsequence
- Longest palindromic substring
- Maximum subarray
- Palindromic substrings
- Unique paths
- Word break