In-depth engineering guides and resources.
Master Divide and Conquer: splitting problems, recursive subproblem solving, and merging solutions with Master Theorem analysis.
Master Dynamic Programming: identifying optimal substructure, overlapping subproblems, memoization vs tabulation, and state transitions.
Master Greedy Algorithms: optimal choice properties, interval scheduling, minimum spanning trees, and trade-offs against dynamic programming.
Master String Algorithms: substring search, rolling hashes, anagram detection, prefix matching, and string manipulation patterns.