🔢 Data Structures & Algorithms

📚 All 41 Topics

Complete DSA curriculum from basics to competition level

🟢 Foundation (Week 1-4)

Arrays Easy

Basic operations, subarray problems, prefix sum, matrix, intervals

Strings Easy

Basic string, anagrams, palindromes, subsequences

Linked Lists Easy

Basic operations, reversal, merge sort, cycle detection

Stacks Easy

Basic stack, parentheses, monotonic stack, expression evaluation

Queues Easy

Basic queue, deque, priority queue, sliding window

Hash Tables Easy

Hash maps, collision handling, frequency counting

🟡 Core Data Structures (Week 5-8)

Trees Medium

Binary trees, traversals, tree construction, path problems

Binary Search Trees Medium

BST operations, balancing, AVL, Red-Black trees

Heaps Medium

Min/Max heap, heapify, priority queue, top-K problems

Graphs Medium

BFS, DFS, representations, connected components

Tries Medium

Prefix trees, autocomplete, word search

Segment Trees Hard

Range queries, lazy propagation, point updates

Union Find Medium

Disjoint sets, path compression, union by rank

⚡ Core Algorithms (Week 9-12)

Sorting Easy

Comparison sorts, non-comparison sorts, custom sorting

Searching Easy

Binary search, ternary search, search patterns

Recursion Medium

Base cases, recursive thinking, tail recursion

Backtracking Medium

Permutations, combinations, N-Queens, Sudoku

Dynamic Programming Hard

1D, 2D, knapsack, LCS, LIS, matrix chain

Greedy Algorithms Medium

Activity selection, Huffman, interval scheduling

Divide & Conquer Medium

Merge sort, quick select, closest pair

🎯 Problem-Solving Techniques

Bit Manipulation Medium

Bitwise operations, XOR tricks, bit masking

Two Pointers Easy

Opposite direction, same direction, fast-slow

Sliding Window Medium

Fixed window, variable window, with hash map

Graph Algorithms Hard

Dijkstra, Bellman-Ford, Floyd-Warshall, MST

Tree Algorithms Medium

LCA, tree DP, diameter, centroid decomposition

Sweep Line Hard

Event processing, interval problems, skyline

🔴 Advanced Data Structures

Advanced Trees Hard

Fenwick tree, 2D segment tree, treap

String Algorithms Hard

KMP, Z-algorithm, suffix array, Rabin-Karp

Computational Geometry Hard

Convex hull, line intersection, polygon area

Interval Trees Medium

Interval scheduling, range updates, overlapping

📐 Mathematics & Theory

Number Theory Hard

GCD, prime sieve, modular arithmetic, Euler's totient

Combinatorics Hard

Counting, generating functions, inclusion-exclusion

Game Theory Hard

Nim, Sprague-Grundy, minimax, alpha-beta

Matrix Exponentiation Hard

Fast Fibonacci, linear recurrence, graph paths

⭐ Competition Level

Sqrt Decomposition Hard

Mo's algorithm, block decomposition

Persistent DS Hard

Persistent segment tree, versioning

Randomized Algorithms Medium

Reservoir sampling, skip lists, hashing

Online Algorithms Hard

LRU cache, streaming algorithms

Approximation Hard

Set cover, TSP approximation, vertex cover

DP Optimizations Hard

Convex hull trick, divide & conquer DP, Knuth

Loop Fusion & Online Hard

Welford, Kadane, recurrence relations

🗺️ Learning Roadmap

                              🎯 DSA MASTERY PATH 🎯

    +-----------------------------------------------------------------+
    |                                                                 |
    |   WEEK 1-4          WEEK 5-8          WEEK 9-12        WEEK 13+ |
    |   ---------         ---------         ---------        -------- |
    |                                                                 |
    |   📦 Arrays         🌲 Trees          🧮 DP            🔴 Adv.   |
    |   📝 Strings        📊 Graphs         ↩️ Backtrack     📐 Math   |
    |   🔗 Lists          🏔️ Heaps          🔍 Binary        ⭐ Comp.  |
    |   #️⃣ Hash Maps     🔀 Union-Find       Search                   |
    |                                                                 |
    |   ------------------------------------------------------------ |
    |   🟢 FOUNDATION     🟡 INTERMEDIATE   🔴 ADVANCED      ⭐ EXPERT |
    |                                                                 |
    +-----------------------------------------------------------------+