DSA

Data Structures

• Array

  • Two Pointer
  • Sliding Window
  • Prefix Sums & Difference Arrays
  • Subarrays & Subsequences

• Linked List

  • Basics of Linked List
  • Linked List Techniques

• Stack & Queues

  • Stack Operations & Applications
  • Queue & Deque Implementations
  • Expression Evaluation & Parsing
  • Monotonic Stacks & Sliding Window Maximum

• Heaps & Priority Queues

  • Min-Heaps & Max-Heaps
  • Applications

• Disjoint Set Union (DSU)(Union-Find)

• Hash Maps & Frequency Counting

Sorting

• Elementary Sorting Strategies
• Quicksort
• Mergesort
• Priority Queues & Heapsort
• Counting Sort, Radix Sort & Bucket Sort
• Special Sorting Techniques

Search

• Binary Search
• Search in Rotated/Sorted Array
• Binary Search Trees (BSTs) Operations
• Hashing Based Search Methods
• Radix Search & Trie-based Search (Optional)

Recursion

• Simple Recursion
• Combinatorics & Permutations
• String Recursion
• Backtracking

Problem Solving Paradigm

• Complete Search (Brute Force)
• Divide & Conquer
• Greedy Algorithms & Strategies
• Dynamic Programming Patterns
  • 1D DP
  • 2D DP
  • Unbounded & Bounded (0/1) Knapsack
  • Grid & Palindrome DP
  • Game & Interval DP
• Advanced DP Problems
  • Bitmask DP
  • DP on Trees
  • Digit DP

Trees

• Binary Trees & Binary Search Trees (BST)
• Problems on Binary Trees
• Tries

Optional Topics in Trees

• Suffix Trees
• Fenwick Trees (Binary Indexed Trees)
• Segment Trees & Lazy Propagation
• Sqrt Decomposition Techniques
• Heap
• Advanced Trees: AVL, Red-Black Trees

Graph

• Graph Properties and their Types
• Graph Traversal (DFS/BFS)
• Digraphs & DAGs (Topological Sorting)
• Shortest Paths (Dijkstra, Bellman-Ford, Floyd-Warshall)
• Minimum Spanning Trees (Kruskal, Prim)
• Network Flow Algorithm (Ford-Fulkerson, Edmond-Karp) (Optional)
• Other Algorithms (SCC, Bridges, Articulation Points)

Strings

• Basic String Processing
• String Matching (KMP, Rabin-Karp, Z-Algorithm)
• Trie Data Structures & Application
• Suffix Tree & Suffix Arrays (Optional)
• String Processing with DP
• String Tasks
• Compression & Encoding Techniques

Additional Topics

• Mathematics
  • Mathematics & Number Theory
  • Modular Arithmetic & Exponentiation
  • Combinatorics & Probability
  • Advanced Math Topics (Optional)
• Binary Manipulation
  • Bit Manipulation
  • Subset Generation & Bitmask DP

• Matrix
• Simulation & Randomized Algorithms
• Meet-in-the-Middle Technique
• Sparse Tables & Range Queries
• Geometry
  • Computational Geometry
  • Points, Lines, Polygons
  • Convex Hull & Line Intersection
  • Advanced Geometry Algorithms