WEEK 1: Core Data Structures (Days 1–7)

📍 Day 1 — Arrays & Strings

• Array basics (declaration, traversal)

• String basics (immutable/mutable in C++, Java, Python)

• Problems: Find min/max, reverse an array

📍 Day 2 — Arrays & Strings Advanced

• 2D Arrays and Matrix operations

• Subarray problems (Kadane’s Algorithm – Max Sum Subarray)

• Problem practice: Sliding window intro

📍 Day 3 — Linked Lists

• Singly Linked List: insert, delete

• Doubly Linked List basics

• Problems: Reverse a linked list

📍 Day 4 — Stacks

• Stack operations (push, pop, peek)

• Applications: Balancing brackets, postfix evaluation

• Problems: Next Greater Element

📍 Day 5 — Queues

• Queue and Circular Queue

• Deque basics

• Problems: Sliding window maximum

📍 Day 6 — Recursion

• Recursive thinking

• Factorial, Fibonacci

• Basic Backtracking (e.g., N-Queens intro)

📍 Day 7 — Weekly Mini Project 1

• Solve 10 problems combining Arrays, Strings, Linked List

• Sample problems:

  • Palindrome String

  • Merge Two Sorted Lists

WEEK 2: Algorithms & Problem-Solving (Days 8–14)

📍 Day 8 — Searching Techniques

• Linear Search

• Binary Search (on sorted array)

• Advanced: Search in Rotated Sorted Array

📍 Day 9 — Sorting Algorithms Part 1

• Bubble Sort, Selection Sort, Insertion Sort

• Complexity analysis

• Code each by hand once

📍 Day 10 — Sorting Algorithms Part 2

• Merge Sort

• Quick Sort

• Practice problems (sorting-based)

📍 Day 11 — Two Pointers & Sliding Window

• Two Pointer technique

• Sliding Window technique

• Problems: Longest Substring Without Repeating Characters

📍 Day 12 — Greedy Algorithms

• Concept of Greedy

• Activity Selection Problem

• Fractional Knapsack

📍 Day 13 — Basic Mathematics for DSA

• Prime Numbers, Sieve of Eratosthenes

• GCD, LCM

• Modular arithmetic basics

📍 Day 14 — Weekly Mini Project 2

• Solve 8 problems:

  • Search problems

  • Greedy problems

  • Math problems

WEEK 3: Advanced DSA (Days 15–21)

📍 Day 15 — Trees: Part 1

• Binary Trees (Basics)

• Traversals: Inorder, Preorder, Postorder

• Problems: Height of Tree

📍 Day 16 — Trees: Part 2

• Binary Search Trees (BSTs)

• Insert, delete, search in BST

• Problems: Lowest Common Ancestor (LCA)

📍 Day 17 — Heaps

• Min-Heap, Max-Heap

• Priority Queue operations

• Problems: K largest/smallest elements

📍 Day 18 — Graphs: Part 1

• Graph representation (Adjacency Matrix/List)

• BFS (Breadth First Search)

• Problems: Detect cycle in an undirected graph

📍 Day 19 — Graphs: Part 2

• DFS (Depth First Search)

• Shortest Path Algorithms (Dijkstra’s basic intro)

📍 Day 20 — Dynamic Programming (DP)

• Introduction to DP

• Memoization vs Tabulation

• Problems:

  • 0/1 Knapsack

  • Fibonacci DP approach

📍 Day 21 — Final Capstone

• Solve 1 Mock Contest or a Set of 5–7 Mixed Problems:

  • Trees, Graphs, DP