Topic No.
Topic Subtopics
1 Basics of Time & Space Complexity, Big O Notation, Recursion Basics
2 Arrays Traversal, Insertion, Deletion, Sorting, Kadane’s Algorithm
3 Strings Palindrome, Anagram, Substrings, Pattern Matching
4 Linked List Singly, Doubly, Circular, Reversal, Loop Detection
5 Stack & QuInfix/Postfix, Balanced Parentheses, Queue Types, Deque
6 Trees Binary Tree, BST, Traversals, LCA, Height, Balanced Tree
7 Heaps & PrMax/Min Heap, Heapify, Kth Largest, Heap Sort
8 Hashing HashMap, HashSet, Frequency Count, Collision Handling
9 Recursion N-Queens, Sudoku, Subsets, Permutations, Maze Problems
10 Graphs Adjacency List/Matrix, BFS, DFS, Dijkstra, MST, Union Find
11 Dynamic P Memoization, Tabulation, Knapsack, LIS, DP on Grid & Trees
12 Greedy AlgActivity Selection, Fractional Knapsack, Job Scheduling
13 Bit ManipuAND, OR, XOR, Power of 2, Count Set Bits
14 Sliding Wi Max Sum Subarray, Longest Substring, Container With Water
15 Practice & LeetCode, GFG, Codeforces, 100+ Problems Practice