Six Month DSA Study Plan

Overview :

This 6-month roadmap is a comprehensive guide to mastering DSA and placement skills. It starts with fundamental topics like arrays, strings, and logical reasoning, gradually progressing to advanced concepts such as dynamic programming, graphs, and tries. The plan concludes with mock tests and interview simulations to solidify your preparation. By completing this roadmap, you'll gain a strong command of problem-solving, be confident in technical interviews, and be well-equipped to crack placements at top companies.

---

Month 1 : Fundamentals and Aptitude Skills

Week 1 : Array and Problem Solving Skills

Topics:

• Array Basics, Sorting, Searching
• Two-pointer, Sliding Window Patterns
• Introduction to Logical Reasoning

Practice(Coding):
i. [Easy] [Two Sum] (https://leetcode.com/problems/two-sum/description/)
ii. [Easy] [Rotate Array] (https://leetcode.com/problems/rotate-array/description/)
iii. [Easy] [Find Missing Number] (https://leetcode.com/problems/missing-number/description/)
iv. [Medium] [Best Time to Buy and Sell Stock] (https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/)
v. [Medium] [Maximum Subarray (Kadane's Algorithm)] (https://leetcode.com/problems/maximum-subarray/description/)

Placement Aptitude:

• Number Series - Easy
• Simple and Compound Interest - Medium

---

Week 2 : String Basics and Aptitude - Logical Reasoning

Topics:

• String Manipulations (Anagrams, Substrings)
• HashMap Applications in Strings
• Logical Reasoning: Puzzles, Statement Analysis

Practice (Coding):

i. [Easy] [Valid Anagram] (https://leetcode.com/problems/valid-anagram/description/)
ii. [Easy] [Longest Common Prefix] (https://leetcode.com/problems/longest-common-prefix/description/)
iii. [Medium] [Longest Substring Without Repeating Characters[ (https://leetcode.com/problems/longest-substring-without-repeating-characters/description/)
iv. [Medium] [Find All Anagrams in a String] (https://leetcode.com/problems/find-all-anagrams-in-a-string/description/)
v. [Medium] [Group Anagrams] (https://leetcode.com/problems/group-anagrams/description/)

Placement Aptitude:

• Blood Relations - Medium
• Direction-Based Problems - Medium

---

Week 3 : Linked List :Basics

Topics:

• Singly Linked List, Fast & Slow Pointers
• Aptitude: Quantitative Analysis

Practice (Coding):

i. [Easy] [Reverse Linked List] (https://leetcode.com/problems/reverse-linked-list/description/)
ii. [Medium] [Merge Two Sorted Lists] (https://leetcode.com/problems/merge-two-sorted-lists/description/)
iii. [Medium] [Linked List Cycle Detection] (https://leetcode.com/problems/linked-list-cycle-ii/description/)
iv. [Medium] [Add Two Numbers] (https://leetcode.com/problems/add-two-numbers/description/)

Placement Aptitude:

• Profit and Loss - Medium
• Ratio and Proportions - Medium

---

Week 4 : Binary Tree :Basics

Topics:

• Binary Tree Traversals (DFS, BFS)
• Aptitude: Data Interpretation

Practice (Coding):

i. [Easy] [Binary Tree Inorder Traversal] (https://leetcode.com/problems/binary-tree-inorder-traversal/description/)
ii. [Easy] [Symmetric Tree] (https://leetcode.com/problems/symmetric-tree/description/)
iii. [Medium] [Binary Tree Level Order Traversal] (https://leetcode.com/problems/binary-tree-level-order-traversal/description/)
iv. [Medium] [Maximum Depth of Binary Tree] (https://leetcode.com/problems/maximum-depth-of-binary-tree/description/)

Placement Aptitude:

• Pie Charts - Medium
• Bar Graph Analysis - Medium

---

Month 2 :Intermediate Topics & Placement Mock Tests

Week 1 : Binary Search and Sorting

Topics:

• Binary Search Variations, Sorting Techniques
• Logical Puzzles (Aptitude)

Practice (Coding):

i. [Medium] [Binary Search] (https://leetcode.com/problems/binary-search/description/)
ii. [Medium] [Search a 2D Matrix] (https://leetcode.com/problems/search-a-2d-matrix/description/)
iii. [Medium] [Find Peak Element] (https://leetcode.com/problems/find-peak-element/description/)

Placement Aptitude:

• Clock Puzzles - Medium
• Seating Arrangements - Medium

---

Week 2: Advanced Arrays & Strings

Topics:

• Advanced Problems with Sliding Window
• Logical Analysis
• 
  

Practice (Coding):

i. [Medium] [Subarray Sum Equals K] (https://leetcode.com/problems/subarray-sum-equals-k/description/)
ii. [Medium] [Minimum Window Substring] (https://leetcode.com/problems/minimum-window-substring/description/)
iii. [Medium] [Product of Array Except Self] (https://leetcode.com/problems/product-of-array-except-self/description/)
iv. [Medium] [Longest Palindromic Substring] (https://leetcode.com/problems/longest-palindromic-substring/description/)

---

#Week 3: Graph Basics Topics:

• Graph Representations, BFS, DFS
• Basic Graph Algorithms

Practice (Coding):

i. [Medium] [Number of Islands] (https://leetcode.com/problems/number-of-islands/description/)
ii. [Medium] [Clone Graph] (https://leetcode.com/problems/clone-graph/description/)
iii. [Medium] [Word Ladder] (https://leetcode.com/problems/word-ladder/description/)

---

Week 4: Recursion and Backtracking

Topics:

• Basic Recursion and Backtracking

Practice (Coding):

i. [Easy] [Subsets] (https://leetcode.com/problems/subsets/description/)
ii. [Medium] [Combination Sum] (https://leetcode.com/problems/combination-sum/description/)
iii. [Medium] [Palindrome Partitioning] (https://leetcode.com/problems/palindrome-partitioning/description/)
iv. [Hard] [N-Queens] (https://leetcode.com/problems/n-queens/description/)

---

Month 3: Dynamic Programming Basics & Optimization

Week 1: Introduction to DP

Topics:

• Memoization and Tabulation Basics

Practice (Coding):

i. [Easy] [Climbing Stairs] (https://leetcode.com/problems/climbing-stairs/description/)
ii. [Medium] [House Robber] (https://leetcode.com/problems/house-robber/description/)
iii. [Medium] [Longest Increasing Subsequence] (https://leetcode.com/problems/longest-increasing-subsequence/description/)
iv. [Medium] [Jump Game] (https://leetcode.com/problems/jump-game/description/)

---

Week 2: Intermediate DP Problems

Topics:

• Knapsack Variants

Practice (Coding):

i. [Medium] [Partition Equal Subset Sum] (https://leetcode.com/problems/partition-equal-subset-sum/description/)
ii. [Medium] [Coin Change] (https://leetcode.com/problems/coin-change/description/)
iii. [Medium] [Target Sum] (https://leetcode.com/problems/target-sum/description/)
iv. [Medium] [Minimum Path Sum] (https://leetcode.com/problems/minimum-path-sum/description/)

---

Week 3: Greedy Algorithms

Topics:

• Interval Problems, Activity Selection

Practice (Coding):

i. [Medium] [Best Time to Buy and Sell Stock II] (https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/)
ii. [Medium] [Jump Game II] (https://leetcode.com/problems/jump-game-ii/description/)
iii. [Medium] [Task Scheduler] (https://leetcode.com/problems/task-scheduler/description/)
iv. [Hard] [Minimum Number of Refueling Stops] (https://leetcode.com/problems/minimum-number-of-refueling-stops/description/)

---

Week 4: Priority Queues & Heaps

Topics:

• Top-K Problems, Min-Heap, Max-Heap

Practice (Coding):

i. [Medium] [Kth Largest Element in an Array] (https://leetcode.com/problems/kth-largest-element-in-an-array/description/)
ii. [Medium] [Merge K Sorted Lists] (https://leetcode.com/problems/merge-k-sorted-lists/description/)
iii. [Medium] [Sliding Window Maximum] (https://leetcode.com/problems/sliding-window-maximum/description/)
iv. [Hard] [Find Median from Data Stream] (https://leetcode.com/problems/find-median-from-data-stream/description/)

---

Month 4: Advanced Topics and Company Patterns

Week 1: Graphs - Advanced Concepts

Topics:

• Topological Sort, Union-Find

Practice (Coding):

i. [Medium] [Alien Dictionary] (https://leetcode.com/problems/alien-dictionary/description/)
ii. [Medium] [Course Schedule II] (https://leetcode.com/problems/course-schedule-ii/description/)

---

Week 2: Advanced DP

Topics:

• DP on Trees

Practice (Coding):

i. [Hard] [Longest Path in a Matrix] (https://leetcode.com/problems/longest-increasing-path-in-a-matrix/description/)

---

Week 3: Tries Basics

Topics:

• Trie Operations, String Matching

Practice (Coding):

i. [Medium] [Implement Trie] (https://leetcode.com/problems/implement-trie-prefix-tree/description/)
ii. [Medium] [Word Search ] (https://leetcode.com/problems/word-search/description/)
iii. [Medium] [Design Search Autocomplete System] (https://leetcode.com/problems/design-search-autocomplete-system/description/)

Months 5 & 6: Revision and Mock Interview Prep

Week 1–4:

Weekly Company-

• Specific Mock Tests: Medium to Hard
• Focused Revision: Review arrays, strings, DP, and graph problems. Medium to Hard
• Mock Interviews: Medium to Hard
• Aptitude Rounds: Continue practice in logical reasoning and data interpretation. Medium

Tips for Maximum Placement Success:

• Set Daily Goals: Spend 2–4 hours daily on coding problems and aptitude.
• Focus on Weak Areas: Weekly reviews to ensure constant improvement.
• Collaborate: Solve problems in groups for better understanding. Track Progress: Use spreadsheets or apps to monitor topic completion and progress.