3 docs tagged with "intermediate"

Master advanced binary search techniques including searching in rotated arrays, finding peak elements, and solving optimization problems like capacity to ship packages.

Master the core concepts of backtracking algorithms including state space exploration, decision trees, pruning strategies, and constraint satisfaction problems.

Learn essential graph algorithms including Dijkstra, Bellman-Ford, topological sort, and minimum spanning trees using Kruskal and Prim algorithms.