DSA (Data Structures & Algorithms) Study Plan

Data structures overview, stacks, queues, hash maps, sorting algorithms, merge sort, quick sort, and custom comparators.

Vanilla binary search, sorted boolean arrays, monotonic functions, boundary finding, first occurrence, square root, rotated arrays, and peak finding.

Same/opposite direction pointers, remove duplicates, two sum sorted, palindrome checking, fixed/longest/shortest windows, prefix sums, and cycle detection.

Recursion review, tree fundamentals, DFS on trees, max depth, balanced trees, inverting trees, BST operations, and lowest common ancestor.

DFS with states, combinatorial search, pruning strategies, phone letter combinations, valid parentheses, permutations, memoization, and deduplication.

BFS fundamentals, level-order traversal, zigzag traversal, binary tree right side view, and minimum depth of binary tree.

Graph fundamentals, BFS/DFS on graphs, shortest path, matrix as graph, flood fill, number of islands, implicit graphs, and word ladder.

Topological sort, task scheduling, alien dictionary, Dijkstra's algorithm, and minimum spanning trees.

Heap fundamentals, K closest points, merge K sorted lists, Kth largest element, reorganize string, and median from data stream.

DP introduction, climbing stairs, house robber, grid-based DP, unique paths, minimum path sum, and maximal square.

Dual-sequence DP (LCS, edit distance), longest increasing subsequence, knapsack problems (0/1, unbounded, coin change), and partition equal subset sum.

Union Find, connected components, Trie data structure, autocomplete with tries, LRU Cache design, and segment trees.

Interval problems, merge intervals, monotonic stack, sliding window maximum, divide and conquer, greedy algorithms, and line sweep.