DSA with C++

Measure time and space growth for loops, recursion, and amortized operations.

Work with arrays in memory, prefix sums, Kadane's algorithm, and matrix traversal.

Handle characters and strings, frequency counting, anagrams, and palindromes.

Learn how hash tables work and apply hashing patterns to classic problems.

Trace recursion, build subsets and permutations, and apply the backtracking template.

Implement the core sorting algorithms, quickselect, and custom comparators.

Apply binary search to sorted arrays, rotated arrays, peaks, and answer spaces.

Solve array and string problems with two pointers and fixed or variable windows.

Build and manipulate linked lists with fast and slow pointers, reversal, and merging.

Use stacks, queues, deques, and monotonic structures for expressions and ranges.

Traverse and build binary trees, work with binary search trees, and implement a trie.

Use heaps for top-K problems, k-way merges, and the two heaps pattern.

Represent graphs and apply BFS, DFS, bipartite checks, cycle detection, and topological sort.

Find shortest paths, use union-find, and build minimum spanning trees.

Turn recursion into DP across 1D, grid, knapsack, subsequence, string, and interval problems.

Recognise when greedy choices work, including interval and scheduling problems.

Use bit tricks and the math that appears most often in DSA problems.

Match patterns in linear time with KMP and the Z algorithm.

Find strongly connected components, bridges, articulation points, and Eulerian paths.

Apply bitmask DP, digit DP, and tree DP with rerooting.

Answer range queries with segment trees, Fenwick trees, binary lifting, and Euler tours.

Recognise patterns, think aloud, and practise with full mock interviews.