In-depth engineering guides and resources.
Master Breadth-First Search (BFS): level-by-level queue traversal, shortest path in unweighted graphs, and connected component discovery.
Master Binary Search: logarithmic search mechanics, monotonic boundaries, edge cases, and lower/upper bound determinations.
Master Depth-First Search (DFS): recursive call stack exploration, cycle detection, connected components, and pathfinding.
Understand Linear Search: sequential scanning, best/worst-case analysis, sentinel linear search, and when linear beats binary search.