DSA Practice Index

1. Basic Data Structures & Algorithms

• 1.1 Arrays
• 1.2 Strings
• 1.3 Linked Lists
• 1.4 Stacks
• 1.5 Queues
• 1.6 Sorting Algorithms
• 1.7 Searching Algorithms

2. Intermediate Data Structures & Algorithms

• 2.1 Hashing
• 2.2 Recursion
• 2.3 Backtracking
• 2.4 Trees
  • 2.4.1 Binary Trees
  • 2.4.2 Binary Search Trees (BST)
• 2.5 Heaps
• 2.6 Graph Algorithms
  • 2.6.1 Graph Representation
  • 2.6.2 BFS & DFS
  • 2.6.3 Topological Sorting

3. Advanced Data Structures & Algorithms

• 3.1 Dynamic Programming (DP)
• 3.2 Advanced Graph Algorithms
  • 3.2.1 Minimum Spanning Tree (MST)
  • 3.2.2 Dijkstra’s Algorithm
  • 3.2.3 Bellman-Ford Algorithm
• 3.3 Tries & Suffix Trees
• 3.4 Segment Trees
• 3.5 Fenwick Trees (Binary Indexed Trees)
• 3.6 Bit Manipulation

4. Specialized Topics for Top Tech Interviews

• 4.1 Advanced Data Structures
  • 4.1.1 AVL Trees
  • 4.1.2 Red-Black Trees
  • 4.1.3 Disjoint Set Union (DSU)
• 4.2 Advanced Math & Combinatorics
  • 4.2.1 Modular Arithmetic
  • 4.2.2 Combinatorics
  • 4.2.3 Number Theory
• 4.3 Game Theory
• 4.4 Greedy Algorithms
• 4.5 Divide & Conquer Techniques