Comprehensive coding interview prep following the Neetcode roadmap: arrays, two pointers, sliding window, stacks, binary search, trees, tries, backtracking, graphs, DP, and more.
Hash maps, prefix sums, and frequency counting
Opposite-end and same-direction pointer techniques on sorted data
LIFO data structure for bracket matching, monotonic stacks, and expression evaluation
Search in sorted and rotated arrays, finding boundaries
XOR tricks, bit counting, and bitwise arithmetic
Palindromes, pattern matching, and string encoding
Fixed and variable-width windows for subarray/substring problems
Pointer manipulation, reversal, cycle detection, and merging
Climbing stairs, house robber, coin change, decode ways, and other linear DP patterns
Locally optimal choices for scheduling, trading, and interval problems
Binary trees, BSTs, traversals, and serialization
Grid paths, LCS, edit distance, and multi-dimensional DP
Merge, insert, and sweep-line techniques for overlapping ranges
Prefix trees for autocomplete, word search, and dictionary operations
Top-K problems, median finding, and priority-based merging
Recursive exploration with constraint pruning
BFS, DFS, topological sort, union-find, and shortest paths
Newton-Raphson, bisection, numerical integration, and floating-point considerations
Matrix multiplication, Gaussian elimination, LU decomposition, and solving Ax=b
Monte Carlo, inverse CDF sampling, antithetic variates, and variance reduction
Gradient descent, Newton's method for optimization, and binary search on answer