DSA Course

Nodes and pointers from scratch — traversal, insertion/deletion, reversal, two-pointers (cycle, middle), and classic interview patterns.

Nodes and recursion from the ground up — traversals (pre/in/post/level), construction, views, paths, LCA, and the core tree patterns.

From adjacency lists to BFS/DFS, cycle detection, topological sort, Dijkstra, Bellman-Ford, max-flow, and grid + coloring patterns.

Hash functions, collisions, chaining vs open addressing, load factor and resizing, and the patterns that make lookups O(1).

How the call stack and memory work, base/recursive cases, tracing recursion, and building the intuition to solve problems recursively.

The enumeration and search patterns — subsets, permutations, combinations, and classics like N-Queens, Sudoku, and rat-in-a-maze.

FIFO from the ground up — array-based and linked queues, circular queues, the core operations, and where queues show up in real problems.

LIFO from the ground up — array and linked stacks, monotonic-stack patterns (next/previous greater), expression parsing, and min/max stack design.

Priority queues from first principles — min/max heaps, heapify, push/pop, building a heap in O(n), and where heaps beat sorting.

Ordered trees that make search, insert, and delete O(log n) — search/insert/delete, balance, iterators, sorted traversal, range queries, and BST-specific patterns.

Two-way nodes that fix what singly linked lists can't — prev/next pointers, insertion and deletion anywhere, reversal patterns, two-pointer tricks, and reorder problems.