Advanced Backtracking
Master advanced backtracking techniques including word search, palindrome partitioning, constraint propagation, and branch-and-bound optimization.
Master advanced backtracking techniques including word search, palindrome partitioning, constraint propagation, and branch-and-bound optimization.
Advanced bit manipulation techniques for complex problems
Sweep line algorithm, closest pair of points, line segment intersection, polygon operations, and 3D geometry basics
Master advanced graph algorithms including Tarjan SCC, bipartite checking, Euler paths, and network flow concepts.
Master advanced greedy techniques including greedy with sorting, priority queue applications, task scheduling, and when greedy fails.
Fast exponentiation, matrix exponentiation, Fibonacci, and advanced number theory
Longest common substring, longest palindromic substring, string compression, and edit distance
Master double-ended queues and priority queues including heap implementation, top-K problems, and running median for advanced queue applications.
Apply dynamic programming to tree and graph problems including tree DP, rerooting technique, DAG DP, and shortest paths as DP.
Master advanced coding techniques including sentinel values, dummy nodes, index mapping, coordinate compression, offline processing, and meet-in-the-middle optimization.
Master advanced linked list techniques including fast-slow pointers, list partitioning, reversal ranges, and LRU cache implementation.