Topic
Breadth-First Search problems
30 problems: 1 Easy, 22 Medium, 7 Hard.
Easy (1)
Medium (22)
- Binary Tree Level Order Traversal
- Shortest Path in Binary Matrix
- Rotting Oranges
- Walls and Gates
- Course Schedule II
- Binary Tree Zigzag Level Order Traversal
- Populating Next Right Pointers in Each Node
- Recover Binary Search Tree
- Number of Provinces
- Minimum Height Trees
- Shortest Path with Alternating Colors
- Minimum Moves to Equal Array Elements II
- Minimum Jumps to Reach Home
- Minimum Moves to Equal Array Elements
- N-ary Tree Level Order
- Sequence Reconstruction
- Tree Diameter
- Step-By-Step Directions From a Binary Tree Node to Another
- Time Needed to Inform All Employees
- Open the Lock
- Snakes and Ladders
- Minimum Genetic Mutation