PROGRESS

0%

Topics

Phase 1 — Foundations

Array & Complexity Analysis0/6
Linear Search & Binary Search0/6
Selection Sort & Sorting Concepts0/6
Two Pointers & Prefix Sum0/6

Phase 2 — Linear Data Structures

Singly Linked List0/6
Doubly Linked List0/6
Stack0/6
Queue0/6
Priority Queue (Heap)0/6
Map, Set & Hashing0/6

Phase 3 — Trees & Heaps

Binary Tree0/6
Binary Search Tree (BST)0/6
Heap Implementation0/6
Trie (Prefix Tree)0/6

Phase 4 — Graph Algorithms

Graph Basics & Representation0/6
Breadth First Search (BFS)0/6
Depth First Search (DFS) & 2D Grid0/6
Dijkstra's Algorithm0/6
Bellman-Ford Algorithm0/6
Floyd-Warshall Algorithm0/6
Topological Sort0/6
Minimum Spanning Tree0/6
DSU & Cycle Detection0/6

Phase 5 — Dynamic Programming

DP Fundamentals0/6
0-1 Knapsack & Variations0/6
Unbounded Knapsack & Variations0/6
LCS & String DP0/6
Interval DP0/6
Grid & Tree DP0/6

Loading...