DSA Reference

Interview-focused reference on array algorithms, traversal patterns, and core techniques including Kadane's, Dutch National Flag, prefix sums, and sliding window.

Interview reference on backtracking, constraint satisfaction, pruning strategies, and classic problems like N-Queens, permutations, and Sudoku.

Interview reference on biconnected components, articulation points (cut vertices), bridges (cut edges), and Tarjan's low-link algorithm.

Interview reference on Fenwick tree operations, prefix sums, point updates, range queries, and 2D BIT extensions.

Interview reference on BST operations, inorder traversal properties, validation, augmentation, and balanced BST variants.

Interview reference on binary search variants, lower/upper bounds, search space reduction, and binary search on the answer technique.