Getting Started
Binary Search
Depth First Search
Backtracking
Breadth First Search
Graph
Two Pointers
Priority Queue / Heap
Dynamic Programming
Advanced Data Structures
Miscellaneous
Objected Oriented Design
System Design
Company-specific OAs
Prereq: BFS on Tree
Given a binary tree, find the depth of the shallowest leaf node.