- #1 Array Sum
- #2 Max in Array
- #4 Rotate Array
- #5 Prefix Sums
- #6 Two Sum
- #10 Anagram Check
- #16 Group Anagrams
- #13 Min Stack
- #17 Binary Search
- #22 Detect Cycle
Practice track
Data Structures & Algorithms
The interview core: arrays and strings through trees, graphs and dynamic programming. Every problem is judged against real test cases.
Solved 0 / 75
3 sections · 75 problems
- #28 Tree Height
- #30 BST Insert
- #31 BST Search
- #33 Graph BFS
- #34 Graph DFS
- #38 Topological Sort
- #45 Kth Largest
- #46 Merge Intervals
- #47 Insert Interval
- #49 Trie Basics
- #52 DP: House Robber
- #53 DP: Coin Change
- #54 DP: 0/1 Knapsack
- #65 DP: Word Break
- #71 Graph: Dijkstra
- #74 Graph: Max Flow