Data Structures & Algorithms
A structured guide to DSA fundamentals — from recursion and complexity analysis through trees, graphs, and core problem-solving patterns.
Topics
| Topic | Description |
|---|---|
| Recursion | Base cases, call stacks, and thinking recursively |
| Time Complexity | Big-O, Big-Θ, Big-Ω — measuring algorithmic growth |
| Arrays | Contiguous memory, indexing, and common operations |
| Linked Lists | Singly, doubly, and circular linked structures |
| Hash Tables | Hashing, collision resolution, and O(1) lookups |
| Binary Search Trees | BST invariant, traversals, balancing |
| Priority Queues (Heap) | Min/max heaps, heapify, and heap sort |
| Tries | Prefix trees for string search and autocomplete |
| Graphs | BFS, DFS, shortest paths, and topological sort |
| Backtracking | Exhaustive search with pruning |
| Two Pointers | Linear-time solutions with left/right pointer pairs |
| Sliding Window | Fixed and variable windows over sequences |