practice
106 problems to solve
Every problem the lessons recommend, in one list. Each links straight to LeetCode — and back to the lesson that teaches the idea, so you can revisit the animation whenever one stumps you.
106 problems
- Assign CookiesEasylearn itGreedy Algorithms
- learn itAVL Tree
- Binary SearchEasy
- learn itTree Traversals
- learn itTree Traversals
- Climbing StairsEasy
- learn itAVL Tree
- Fibonacci NumberEasylearn itRecursion & the Call Stack
- learn itLinear Search
- learn itBinary Search
- Flood FillEasylearn itDepth-First Search
- Happy NumberEasylearn itSets
- Height CheckerEasy
- learn itQueue
- learn itSets
- learn itHeap & Priority Queue
- Majority ElementEasylearn itLinear Search
- learn itSliding Window
- learn itMerge Sort
- learn itLinked List
- Missing NumberEasylearn itLinear Search
- learn itCircular Queue
- learn itMonotonic Stack
- learn itLinked List
- Reverse StringEasylearn itStrings
- learn itBinary Search Tree
- learn itBinary Search
- learn itCounting Sort
- Two SumEasy
- Valid AnagramEasylearn itStrings
- Valid PalindromeEasy
- learn itStack
- Accounts MergeMediumlearn itUnion-Find
- learn itAVL Tree
- Coin ChangeMediumlearn itDynamic Programming
- Combination SumMediumlearn itBacktracking
- learn itTwo Pointers
- Course ScheduleMediumlearn itTopological Sort
- Course Schedule IIMediumlearn itTopological Sort
- Daily TemperaturesMediumlearn itMonotonic Stack
- learn itTrie (Prefix Tree)
- Design Browser HistoryMediumlearn itDoubly Linked List
- Design Circular DequeMediumlearn itCircular Queue
- Design Circular QueueMedium
- learn itDeque
- learn itStack
- learn itTopological Sort
- learn itBinary Search
- Find Peak ElementMediumlearn itTernary Search
- learn itBellman–Ford
- learn itDoubly Linked List
- Group AnagramsMediumlearn itHash Map
- House RobberMediumlearn itDynamic Programming
- learn itTrie (Prefix Tree)
- learn itBinary Search Tree
- learn itCircular Linked List
- Insertion Sort ListMediumlearn itInsertion Sort
- Jump GameMediumlearn itGreedy Algorithms
- Linked List Cycle IIMediumlearn itCircular Linked List
- learn itDynamic Programming
- learn itSets
- learn itSliding Window
- LRU CacheMediumlearn itDoubly Linked List
- Max Area of IslandMediumlearn itDepth-First Search
- Maximum GapMediumlearn itRadix Sort
- Min StackMediumlearn itStack
- Minimum Knight MovesMediumlearn itA* Search
- learn itGreedy Algorithms
- Network Delay TimeMedium
- learn itGreedy Algorithms
- Number of IslandsMedium
- Number of ProvincesMediumlearn itUnion-Find
- learn itDijkstra's Shortest Path
- learn itTernary Search
- PermutationsMediumlearn itBacktracking
- Pow(x, n)Mediumlearn itRecursion & the Call Stack
- learn itSegment Tree
- Redundant ConnectionMediumlearn itUnion-Find
- Rotate ImageMediumlearn it2D Arrays
- Rotting OrangesMediumlearn itBreadth-First Search
- Set Matrix ZeroesMediumlearn it2D Arrays
- learn itA* Search
- Sort an ArrayMedium
- Sort ColorsMedium
- Spiral MatrixMediumlearn it2D Arrays
- SubsetsMediumlearn itBacktracking
- Top K Frequent ElementsMedium
- learn itTwo Pointers
- learn itBinary Search Tree
- Word SearchMediumlearn itBacktracking
- learn itMonotonic Stack
- N-QueensHardlearn itBacktracking
- learn itSegment Tree
- Sliding PuzzleHardlearn itA* Search
- learn itDeque
- learn itMonotonic Stack
- Word Search IIHardlearn itTrie (Prefix Tree)