[go: up one dir, main page]
Scribd
Upload
196 views2 pages

DSA 6 Month Plan

The document outlines a 6-month Data Structures and Algorithms (DSA) study plan divided into monthly topics, each focusing on specific data structures and algorithms with a set number of problems to solve. It includes a detailed weekly breakdown for each month, covering basics, arrays, linked lists, trees, graphs, dynamic programming, and advanced topics, along with revision and mock interview preparation. Final tips emphasize adherence to the schedule, utilizing various platforms for practice, and conducting mock interviews for placement readiness.

Uploaded by

rhonny069
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
196 views2 pages

DSA 6 Month Plan

The document outlines a 6-month Data Structures and Algorithms (DSA) study plan divided into monthly topics, each focusing on specific data structures and algorithms with a set number of problems to solve. It includes a detailed weekly breakdown for each month, covering basics, arrays, linked lists, trees, graphs, dynamic programming, and advanced topics, along with revision and mock interview preparation. Final tips emphasize adherence to the schedule, utilizing various platforms for practice, and conducting mock interviews for placement readiness.

Uploaded by

rhonny069
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

6-Month DSA Plan (Striver's A2Z Sheet)

Month 1: Basics & Arrays (80 Questions)


- Week 1 (Days 1-7): Introduction & Mathematics
- Time Complexity, Recursion Basics (2 problems/day)
- Sorting (Bubble, Selection, Insertion) (3 problems/day)
- Binary Search Variations (3 problems/day)
- Revise & Solve 2 Medium Problems

- Week 2-3 (Days 8-21): Arrays & Two Pointers


- Kadane's Algorithm, Two Pointers, Sliding Window (2-3 problems/day)
- Merge Intervals, Stock Buy/Sell (2 problems/day)
- Solve 20-25 Array problems

- Week 4 (Days 22-28): Recursion & Backtracking


- Subsets, Permutations, N-Queens, Sudoku Solver (2-3 problems/day)

Month 2: Linked List, Stack & Queue (80 Questions)


- Week 5-6 (Days 29-42): Linked Lists
- Reverse Linked List, Detect Cycle, Merge Sort (3 problems/day)

- Week 7 (Days 43-49): Stacks & Queues


- Next Greater Element, LRU Cache, Circular Queue (2 problems/day)

- Week 8 (Days 50-56): Sliding Window & Monotonic Stack


- Solve 10-12 problems from A2Z Sheet

Month 3: Trees & Binary Search (80 Questions)


- Week 9-10 (Days 57-70): Trees Basics
- Inorder, Preorder, Postorder Traversal (3 problems/day)
- Lowest Common Ancestor, Diameter, Flatten Tree

- Week 11-12 (Days 71-84): Heaps & Priority Queue


- Kth Largest Element, Merge K Sorted Lists (2-3 problems/day)
- Median in Data Stream, Top K Frequent Elements

Month 4: Graphs & Dynamic Programming (90 Questions)


- Week 13-14 (Days 85-98): Graphs (BFS, DFS, MST)
- BFS, DFS, Dijkstra, Bellman-Ford, Kruskal's Algorithm

- Week 15-16 (Days 99-112): Dynamic Programming Basics


- Fibonacci DP, Knapsack, Longest Common Subsequence (2-3 problems/day)
Month 5: Advanced DSA (80 Questions)
- Week 17-18 (Days 113-126): Advanced DP
- Matrix Chain Multiplication, Palindromic Substrings (3 problems/day)

- Week 19-20 (Days 127-140): Trie, Disjoint Set & Segment Tree
- Trie Insert, Search, Delete (3 problems/day)
- Union-Find, Cycle Detection

Month 6: Revision & Mock Interviews (40+ Questions)


- Week 21-22 (Days 141-154): Revision & Mock Tests
- Revise Graphs, Trees, DP (Solve past mistakes)

- Week 23-24 (Days 155-168): Contests & Final Push


- LeetCode Weekly Contests, CodeForces Contests

Final Tips:
- Follow the schedule strictly (2-3 hours daily)
- Use LeetCode, CodeForces & GeeksforGeeks for practice
- Take mock interviews to prepare for placements

You might also like