Data Structures & Algorithms: Advanced

Syllabus

Every module is taught live, with practice problems and assignments between classes.

1. 01Programming Fundamentals5 topics +

   • Variables, data types and operators
   • Conditionals and loops
   • Functions
   • Recursion
   • Complexity analysis
2. 02Arrays6 topics +

   • Traversal, insertion, deletion
   • Linear and binary search
   • Prefix sum
   • Sliding window
   • Two pointers
   • Kadane's algorithm
3. 03Strings7 topics +

   • String operations
   • Pattern matching
   • Palindromes
   • Anagrams
   • String hashing
   • KMP (optional)
   • Rabin-Karp (optional)
4. 04Linked Lists5 topics +

   • Singly, doubly and circular lists
   • Insertion and deletion
   • Reversal
   • Cycle detection
   • Merging
5. 05Stack5 topics +

   • Implementation
   • Applications
   • Balanced parentheses
   • Next greater element
   • Monotonic stack
6. 06Queue5 topics +

   • Implementation
   • Circular queue
   • Deque
   • Priority queue
   • Monotonic queue
7. 07Hashing4 topics +

   • Hash maps and sets
   • Frequency counting
   • Collision handling
   • Hashing-based problem solving
8. 08Sorting8 topics +

   • Bubble
   • Selection
   • Insertion
   • Merge
   • Quick
   • Heap
   • Counting
   • Radix
9. 09Searching3 topics +

   • Linear search
   • Binary search
   • Binary search on answer
10. 10Trees6 topics +

    • Binary trees
    • BST
    • Traversals
    • Level order
    • Height and diameter
    • LCA
11. 11Heap / Priority Queue5 topics +

    • Min and max heap
    • Heap operations
    • Heap sort
    • Top-K problems
    • Priority queue applications
12. 12Trie3 topics +

    • Implementation
    • Prefix search
    • Autocomplete
13. 13Graphs8 topics +

    • Representation
    • BFS and DFS
    • Connected components
    • Cycle detection
    • Topological sort
    • Dijkstra, Bellman-Ford, Floyd-Warshall
    • Prim's and Kruskal's MST
    • Disjoint Set Union
14. 14Greedy Algorithms5 topics +

    • Greedy strategy
    • Activity selection
    • Fractional knapsack
    • Huffman coding
    • Interval scheduling
15. 15Backtracking5 topics +

    • N-Queens
    • Sudoku solver
    • Rat in a maze
    • Permutations
    • Subsets
16. 16Divide and Conquer4 topics +

    • Merge sort
    • Quick sort
    • Binary search
    • Closest pair of points
17. 17Dynamic Programming9 topics +

    • Memoization and tabulation
    • 0/1 knapsack
    • LCS
    • LIS
    • Matrix chain multiplication
    • Coin change
    • Edit distance
    • DP on trees
    • Bitmask DP
18. 18Bit Manipulation5 topics +

    • Bitwise operators
    • Set, clear, toggle bits
    • Powers of two
    • XOR techniques
    • Bitmasking
19. 19Advanced Data Structures7 topics +

    • Segment tree
    • Fenwick tree
    • Sparse table
    • Suffix array
    • Suffix tree
    • Rolling hash
    • Network flow
20. 20Problem-Solving Practice2 topics +

    • Mixed practice across all topics
    • Math and number theory