• Importance of Data Structures & Algorithms
• Time Complexity & Big-O Notation
• Space Complexity & Optimization Techniques
• Asymptotic Analysis of Algorithms

Arrays & Strings

• Basics of Arrays & Memory Representation
• Two-Pointer & Sliding Window Techniques
• Prefix Sum & Kadane’s Algorithm
• String Manipulation & Pattern Matching (KMP Algorithm)

Linked Lists

• Singly Linked List – Insertion, Deletion, Reversal
• Doubly Linked List – Insertion, Deletion
• Circular Linked List – Applications

Stacks & Queues

• • Stack & its Applications (Next Greater Element, Balanced Parentheses)
  • Queue & its Applications (Sliding Window Maximum)
  • Priority Queue (Heap) – Min Heap, Max Heap, Heapify

• Basics of Recursion & Recursive Tree Visualization
• Factorial, Fibonacci, and Tower of Hanoi
• Backtracking Approach (N-Queens, Sudoku Solver)
• Subset Sum & Combination Problems

Sorting Algorithms

• Bubble Sort, Selection Sort, Insertion Sort
• Merge Sort, Quick Sort (Divide & Conquer)
• Counting Sort, Radix Sort, Bucket Sort

Searching Algorithms

• • Linear Search & Binary Search
  • Binary Search Variants (Lower Bound, Upper Bound, Search in Rotated Sorted Array)
  • Ternary Search & Exponential Search

• Hash Tables & Hash Maps – Collisions & Hash Functions
• Trie (Prefix Tree) – Auto-Complete, Spell Checker
• Disjoint Set (Union-Find) – Path Compression & Applications
• Segment Tree & Fenwick Tree – Range Queries & Updates