DSA Interview Preparation: 60-Day Roadmap for Indian Product Companies (2026)

If you're targeting product companies like Google, Amazon, Microsoft, Flipkart, Swiggy, or Razorpay, you already know the drill: DSA interviews decide everything. Your college, your CGPA, even your projects take a backseat the moment you step into that coding round.

The harsh truth? Most Indian engineering students start DSA prep way too late, binge-watch YouTube tutorials without solving problems, and panic two weeks before their dream company's interview. This article gives you a structured 60-day DSA roadmap that works for freshers, experienced developers switching companies, and anyone serious about cracking product-based interviews in 2026.

Who Actually Needs DSA Preparation?#

Let's clear the confusion first. Not every software job in India requires DSA mastery. Here's the breakdown:

Product Companies (DSA-heavy interviews)

• FAANG/MAANG: Google, Amazon, Meta, Apple, Netflix, Microsoft
• Indian Unicorns: Flipkart, Swiggy, Zomato, Razorpay, Zepto, PhonePe
• Growing Startups: Meesho, Cred, Nykaa, Urban Company, Groww
• Interview Pattern: 2-4 DSA rounds + 1 system design (for senior roles)
• What they test: Problem-solving, algorithm optimization, code quality

Service Companies (DSA-light interviews)

• Mass Recruiters: TCS, Infosys, Wipro, Cognizant, Accenture
• Interview Pattern: Basic coding (loop/array questions) + HR rounds
• What they test: Communication, aptitude, basic programming syntax

Bottom line: If you're targeting packages above 10 LPA as a fresher or 20+ LPA as an experienced developer, DSA is non-negotiable. Service companies might take you without it, but product companies won't even shortlist your resume if you can't solve Medium-level LeetCode in 45 minutes.

Why 60 Days? The Science Behind This Timeline#

You might have seen "30-day crash courses" or "6-month detailed plans" online. Here's why 60 days is the sweet spot for most Indian job seekers:

Too short (15-30 days): You'll memorize solutions, not understand patterns. Fails the moment interviewers twist a problem slightly.

Too long (6+ months): Motivation drops, you forget earlier topics, analysis paralysis kicks in. Most people quit by month 3.

60 days = Perfect balance:

• 8 weeks to cover all major topics thoroughly
• Time for 150+ problems (the magic number for pattern recognition)
• Enough revision cycles to retain concepts
• Realistic for someone with college/job + 3-4 hours daily

The 60-Day Week-by-Week Breakdown#

Week 1-2: Arrays, Strings, and Hashing (Foundation Phase)

Why start here: 40% of all interview problems use arrays/strings. Master these, and you're already ahead of 60% of candidates.

Topics to cover:

• Two-pointer technique
• Sliding window
• Prefix sum arrays
• HashMaps/HashSets for O(1) lookups
• String manipulation (substring, palindrome, anagram patterns)

Must-solve problems (20 problems):

1. LC #1 - Two Sum (HashMap basics)
2. LC #3 - Longest Substring Without Repeating Characters (sliding window classic)
3. LC #11 - Container With Most Water (two-pointer)
4. LC #15 - 3Sum (avoid duplicates pattern)
5. LC #26 - Remove Duplicates from Sorted Array
6. LC #49 - Group Anagrams (HashMap + sorting)
7. LC #53 - Maximum Subarray (Kadane's algorithm)
8. LC #121 - Best Time to Buy and Sell Stock
9. LC #128 - Longest Consecutive Sequence
10. LC #242 - Valid Anagram
11. LC #271 - Encode and Decode Strings
12. LC #217 - Contains Duplicate
13. LC #238 - Product of Array Except Self (prefix/suffix magic)
14. LC #424 - Longest Repeating Character Replacement
15. LC #567 - Permutation in String
16. LC #76 - Minimum Window Substring (hard but frequently asked)
17. LC #560 - Subarray Sum Equals K
18. LC #862 - Shortest Subarray with Sum at Least K
19. LC #1004 - Max Consecutive Ones III
20. LC #2461 - Maximum Sum of Distinct Subarrays With Length K

Week 1-2 study routine:

• Day 1-3: Watch Striver's A2Z DSA sheet videos on arrays (YouTube: takeUforward)
• Day 4-10: Solve 2-3 problems daily, starting Easy then Medium
• Day 11-14: Revisit all problems, try solving without hints

Key pattern recognition: By the end of Week 2, you should automatically think "Can I use two pointers here?" or "Is there a sliding window approach?" when you see array/string problems.

---

Week 3-4: Linked Lists, Stacks, Queues, and Trees (Data Structure Mastery)

Why this matters: Trees alone make up 25% of product company interviews. Linked Lists test your pointer manipulation skills (Amazon loves these).

Topics to cover:

• Linked List: Reversal, cycle detection, merge operations
• Stacks: Monotonic stack pattern (next greater/smaller element)
• Queues: Deque for sliding window maximum
• Binary Trees: Traversals (inorder/preorder/postorder), BFS/DFS
• Binary Search Trees: Validation, LCA (Lowest Common Ancestor)

Must-solve problems (25 problems):

Linked Lists: 21. LC #2 - Add Two Numbers 22. LC #19 - Remove Nth Node From End 23. LC #21 - Merge Two Sorted Lists 24. LC #23 - Merge K Sorted Lists (priority queue) 25. LC #141 - Linked List Cycle 26. LC #143 - Reorder List 27. LC #206 - Reverse Linked List

Stacks/Queues: 28. LC #20 - Valid Parentheses 29. LC #84 - Largest Rectangle in Histogram (monotonic stack) 30. LC #155 - Min Stack 31. LC #739 - Daily Temperatures 32. LC #853 - Car Fleet

Trees: 33. LC #94 - Binary Tree Inorder Traversal 34. LC #100 - Same Tree 35. LC #102 - Binary Tree Level Order Traversal (BFS) 36. LC #104 - Maximum Depth of Binary Tree 37. LC #105 - Construct Binary Tree from Preorder and Inorder 38. LC #124 - Binary Tree Maximum Path Sum (hard but classic) 39. LC #199 - Binary Tree Right Side View 40. LC #226 - Invert Binary Tree 41. LC #230 - Kth Smallest Element in a BST 42. LC #235 - Lowest Common Ancestor of a BST 43. LC #297 - Serialize and Deserialize Binary Tree 44. LC #572 - Subtree of Another Tree 45. LC #543 - Diameter of Binary Tree

Week 3-4 study routine:

• Day 15-18: Linked Lists + Stacks/Queues (3 problems/day)
• Day 19-25: Trees (4 problems/day - high priority)
• Day 26-28: Revision + solve 2 random problems from Week 1-2

Pro tip: For tree problems, always draw them out on paper first. Write the recursive base case before touching the keyboard.

---

Week 5-6: Graphs, Dynamic Programming, and Binary Search (Advanced Problem Solving)

Reality check: This is where 70% of candidates struggle. DP and Graphs separate "got the offer" from "thanks for applying."

Topics to cover:

• Graphs: BFS/DFS traversal, cycle detection, topological sort, Dijkstra's
• Dynamic Programming: 1D DP (climbing stairs pattern), 2D DP (grid problems), knapsack variations
• Binary Search: Search space reduction, answer lies in range [L, R]

Must-solve problems (30 problems):

Graphs: 46. LC #133 - Clone Graph 47. LC #200 - Number of Islands (BFS/DFS classic) 48. LC #207 - Course Schedule (cycle detection) 49. LC #261 - Graph Valid Tree 50. LC #269 - Alien Dictionary 51. LC #323 - Number of Connected Components 52. LC #417 - Pacific Atlantic Water Flow 53. LC #684 - Redundant Connection 54. LC #695 - Max Area of Island 55. LC #787 - Cheapest Flights Within K Stops 56. LC #994 - Rotting Oranges (multi-source BFS)

Dynamic Programming: 57. LC #5 - Longest Palindromic Substring 58. LC #62 - Unique Paths 59. LC #70 - Climbing Stairs (DP intro) 60. LC #72 - Edit Distance (Google favorite) 61. LC #91 - Decode Ways 62. LC #139 - Word Break 63. LC #198 - House Robber 64. LC #213 - House Robber II 65. LC #300 - Longest Increasing Subsequence 66. LC #322 - Coin Change 67. LC #416 - Partition Equal Subset Sum (0/1 knapsack) 68. LC #518 - Coin Change II 69. LC #647 - Palindromic Substrings 70. LC #1143 - Longest Common Subsequence

Binary Search: 71. LC #33 - Search in Rotated Sorted Array 72. LC #74 - Search a 2D Matrix 73. LC #153 - Find Minimum in Rotated Sorted Array 74. LC #162 - Find Peak Element 75. LC #875 - Koko Eating Bananas (search space = answers)

Week 5-6 study routine:

• Day 29-35: Graphs (2 problems/day) + watch NeetCode's graph playlist
• Day 36-42: DP (3 problems/day) - expect to struggle, it's normal
• Day 41-42: Binary Search (2 problems/day)

DP survival tips:

1. Always start by identifying state (what changes between subproblems?)
2. Write the recurrence relation on paper first
3. Memoization (top-down) is easier to code than tabulation initially
4. If you're stuck for 45+ minutes, watch the solution explanation, then code from memory the next day

---

Week 7-8: Advanced Topics + Mock Interviews (Battle-Ready Phase)

Focus: Backtracking, Tries, Heaps, and most importantly, interview simulation under time pressure.

Topics to cover:

• Backtracking: Permutations, combinations, Sudoku solver
• Tries: Prefix trees for word problems
• Heaps: Top K problems, merge K lists
• Bit manipulation: XOR tricks, subset generation

Must-solve problems (25 problems):

Backtracking: 76. LC #17 - Letter Combinations of a Phone Number 77. LC #39 - Combination Sum 78. LC #46 - Permutations 79. LC #78 - Subsets 80. LC #79 - Word Search 81. LC #90 - Subsets II

Tries: 82. LC #208 - Implement Trie 83. LC #211 - Design Add and Search Words Data Structure 84. LC #212 - Word Search II

Heaps: 85. LC #23 - Merge K Sorted Lists (heap) 86. LC #215 - Kth Largest Element 87. LC #295 - Find Median from Data Stream 88. LC #347 - Top K Frequent Elements 89. LC #373 - Find K Pairs with Smallest Sums 90. LC #703 - Kth Largest Element in a Stream

Bit Manipulation: 91. LC #136 - Single Number 92. LC #190 - Reverse Bits 93. LC #191 - Number of 1 Bits 94. LC #268 - Missing Number 95. LC #338 - Counting Bits

Advanced/Miscellaneous: 96. LC #42 - Trapping Rain Water 97. LC #146 - LRU Cache (design problem) 98. LC #224 - Basic Calculator 99. LC #295 - Find Median from Data Stream 100. LC #380 - Insert Delete GetRandom O(1)

Week 7-8 study routine:

• Day 43-49: Solve 2-3 problems/day from new topics
• Day 50-56: MOCK INTERVIEW MODE - Set a 45-minute timer, solve 1 Medium + 1 Easy daily as if you're in a real interview
• Day 57-60: Revision of all 100 problems - can you recognize the pattern in 30 seconds?

Mock interview rules (critical for success):

1. Use a timer: 45 minutes for 2 problems or 60 minutes for 1 Hard
2. Talk out loud: Explain your approach before coding (practice for Zoom interviews)
3. Write test cases first: Edge cases, empty input, single element
4. No hints allowed: Treat it like the real thing
5. Code on a whiteboard or Google Doc (not LeetCode IDE) - closer to interview conditions

---

Company-Specific DSA Patterns (2026 Trends)#

Based on recent interview experiences shared on LeetCode Discuss and GeeksforGeeks, here's what each company loves:

Amazon (BFS/DFS + Sliding Window)

• Loves graph traversal problems (Number of Islands variations)
• Sliding window appears in 60% of Amazon rounds
• Leadership Principles questions before DSA - prepare "Tell me about a time when..." stories
• Focus problems: LC #200, LC #994, LC #3, LC #76

Google (Dynamic Programming + Math)

• Expects optimal solutions (brute force won't cut it)
• DP + Greedy combination problems
• Asks "Can you optimize further?" even if you solve correctly
• Focus problems: LC #72, LC #300, LC #322, LC #1143

Microsoft (Trees + System Design)

• Tree problems in 80% of interviews
• Behavioral round is heavily weighted
• Asks about trade-offs (time vs space complexity)
• Focus problems: LC #102, LC #124, LC #297, LC #543

Flipkart/Swiggy (Arrays + Real-World Scenarios)

• Loves problems related to e-commerce/delivery (disguised array problems)
• Example: "Design a cart system" → LRU Cache problem
• Tests SQL + DSA both
• Focus problems: LC #146, LC #238, LC #560

Razorpay/PhonePe (Strings + Edge Cases)

• Financial calculations → precision with decimals, overflow handling
• String parsing (transaction IDs, API responses)
• Expects you to ask clarifying questions about constraints
• Focus problems: LC #8, LC #43, LC #271

---

Must-Use Resources for DSA Preparation (Free + Paid)#

Free Resources (Enough to crack any interview):

1. Striver's A2Z DSA Sheet (takeuforward.org)

   • Most structured free resource for Indian students
   • YouTube channel: takeUforward (Raj Vikramaditya)
   • Covers every topic with clear explanations in Hinglish

2. NeetCode 150 (neetcode.io)

   • Curated list of 150 essential LeetCode problems
   • Video solutions for each problem
   • Organized by pattern (better than random solving)

3. LeetCode Free Tier

   • Filter by difficulty + company tags
   • Discussion section has recent interview experiences
   • "Top Interview Questions" list is gold

4. GeeksforGeeks Practice

   • Good for understanding theory before LeetCode
   • Company-specific archives (Amazon asked questions, etc.)

Paid Resources (Optional but helpful):

1. LeetCode Premium ($35/month or $99/year)

   • Worth it if: You're targeting FAANG and want company-specific problem sets
   • Skip it if: You're a student on a budget - free resources are enough

2. AlgoExpert ($99 one-time)

   • Video explanations + clean UI
   • Good for absolute beginners who find LeetCode overwhelming

3. Scaler/InterviewBit (₹2-3 lakhs for full courses)

   • Skip it - overpriced for what you get. Free YouTube content is equally good.

---

How to Practice DSA Effectively (Avoiding Common Mistakes)#

Mistake #1: Tutorial Hell

❌ Watching 10 YouTube videos on trees without solving a single problem ✅ Watch 1 explanation video → Solve 3 related problems immediately

Mistake #2: Only Solving Easy Problems

❌ Solving 100 Easy problems to feel productive ✅ 70% Medium + 20% Hard + 10% Easy is the right mix

Mistake #3: Not Timing Yourself

❌ Taking 3 hours to solve a Medium problem ✅ Set a 45-minute timer. If stuck, read hints, solve, and retry tomorrow

Mistake #4: Copy-Pasting Solutions

❌ Copying the top-voted LeetCode solution without understanding ✅ Read solution → Close tab → Code from memory → Explain out loud

Mistake #5: Ignoring Space Complexity

❌ Only optimizing time complexity ✅ Interviewers ask "Can you do this in O(1) space?" - always analyze both

The 3-Pass Method (For Long-Term Retention):

1. First Pass: Solve the problem (take 60-90 minutes if needed)
2. Second Pass (Next Day): Solve the same problem in under 30 minutes
3. Third Pass (One Week Later): Solve in under 15 minutes without hints

---

Week-Wise Time Allocation (For Working Professionals & Students)#

If You Have 3-4 Hours Daily:

• 1 hour: New concept learning (video/article)
• 2 hours: Problem solving (2-3 problems)
• 30 minutes: Revision (solve 1 old problem)
• 30 minutes: Note-taking (pattern templates, common mistakes)

If You Have 1-2 Hours Daily (Busy Schedule):

• Extend the 60-day plan to 90 days
• Focus on 1 problem/day but solve it deeply
• Use weekends for catching up (4-5 hours on Saturdays)

If You Have 6+ Hours Daily (Full-Time Prep):

• Compress the plan to 45 days
• Solve 4-5 problems/day
• Add system design prep in the evenings (for experienced roles)

---

Tracking Your Progress (The 150-Problem Milestone)#

Create a Google Sheet with these columns:

• Problem Name | LeetCode # | Difficulty | Topic | First Attempt (Pass/Fail) | Time Taken | Revision Date

Target metrics by Day 60:

• ✅ 150+ problems solved (Easy: 30, Medium: 100, Hard: 20)
• ✅ Can identify the pattern within 2 minutes of reading
• ✅ Solve Medium problems in under 30 minutes
• ✅ Explain your solution clearly (practice for behavioral rounds)

---

What Happens After 60 Days?#

You're now in the top 10% of Indian engineering candidates for product companies. But DSA prep doesn't end here.

Maintenance mode (10 hours/week):

• Solve 1 random Medium problem daily (15-20 min)
• 1 mock interview on weekends
• Stay active on LeetCode/GeeksforGeeks to see trending problems

Start applying when:

• You've hit 120+ problems (you don't need 500+ problems)
• You can solve 70% of Medium problems without hints
• You've done at least 5 timed mock interviews

Interview preparation checklist:

• Resume optimized with ATS keywords (use JobRise's ATS checker)
• GitHub profile with 2-3 DSA projects (sorting visualizer, LRU cache implementation)
• LinkedIn headline updated: "Software Engineer | DSA Enthusiast | Solved 150+ LeetCode"
• Mock interview practice with a friend or on Pramp.com

---

Final Thoughts: Consistency Over Intensity#

The difference between candidates who crack Google and those who don't isn't intelligence - it's showing up daily for 60 days straight. Even on days when you're tired, solve just 1 Easy problem. The pattern recognition happens gradually, not overnight.

Indian engineering students face unique challenges: placements during semester exams, toxic college environments, zero structured placement support. But DSA is the great equalizer - a student from a tier-3 college who's solved 200 problems will outperform an IITian who's solved 50.

Your 60-day action plan starts now:

1. Bookmark Striver's A2Z sheet and NeetCode 150
2. Create a study schedule (be realistic - 2 hours minimum)
3. Join the LeetCode Daily Challenge (accountability matters)
4. Track every problem in a Google Sheet
5. Join Indian DSA communities on Discord/Telegram for peer support

And remember: every Google engineer, every Amazon SDE-2, every Flipkart senior developer was once exactly where you are now - staring at a LeetCode problem, feeling overwhelmed. The only difference? They kept going.

Ready to start your DSA journey? Use JobRise's AI-powered mock interview tool to practice under real interview conditions. Get instant feedback on your problem-solving approach, code quality, and communication skills.

Good luck! You've got this.

---

Related Articles:

• How to Crack Amazon SDE Interview in 2026: Complete Preparation Guide
• System Design Interview Prep for Indian Developers (2-4 YOE)
• Top 50 Coding Interview Questions Asked in Indian Startups