Skip to main content
FREE Mock interview & resume review with Sumit. Free right now, no payment needed.Book a slot

JioCoder 450: The Complete DSA Roadmap with a To-Do Checklist (Part 1)

A 454-problem DSA roadmap in 18 phases with a to-do box and LeetCode/GFG link for every question. Part 1 covers Phases 1 to 9: basics to stacks and queues.

Sumit KumarUpdated Oct 22, 202615 min readDSA
JioCoder 450: The Complete DSA Roadmap with a To-Do Checklist (Part 1)

The JioCoder 450 is a complete DSA roadmap of 454 hand-picked problems in 18 phases, ordered so every topic builds on the one before it. Every question has a ☐ to-do box and a practice link, and 78 core topics are explained with JavaScript code in two companion guides.

Why most people quit DSA#

Most people who start DSA give up within a month. Not because the problems are too hard, but because they jump between random problem lists, solve whatever looks interesting, and never build a foundation. One day it's a graph problem, the next day it's DP, and nothing sticks.

This roadmap fixes that with a single path. It starts with loops and basic maths, moves through arrays, binary search, linked lists and recursion, and ends with graphs, dynamic programming and advanced string algorithms. Every phase uses ideas from the phases before it.

Who this roadmap is for#

  • Complete beginners who know one programming language and want a clear starting point.
  • Working developers preparing to switch jobs, who need a structured plan that fits around a full-time role.
  • Students preparing for placements, who want coverage of every topic that shows up in coding rounds.

How to use this roadmap#

  • Every question starts with a ☐ box. Copy the list into your notes app (Notion, Google Keep, Apple Notes) to turn the boxes into a working checklist, or print the page and tick them by hand.
  • LeetCode links open the problem on LeetCode. GFG links open it on GeeksforGeeks for problems that aren't on LeetCode.
  • Items marked Concept are theory you learn rather than solve.
  • Topics marked lesson have a short lesson in the companion guides Concepts Part 1 (Phases 1 to 9) and Concepts Part 2 (Phases 10 to 18): the idea, key points, time complexity and a JavaScript implementation.
  • This page covers Phases 1 to 9. Phases 10 to 18 are in Roadmap Part 2.

How to solve each problem#

Don't jump straight to the optimal solution. Interviewers want to see how you think, so walk through three levels:

  1. Brute force: write the simplest solution that works and state its time and space complexity.
  2. Better: find the repeated work. Can a hash map, sorting or a prefix sum remove a loop?
  3. Optimal: reach the best known complexity, code it cleanly and dry-run it on an edge case.
Tip

If you're stuck for more than 30 to 40 minutes, read the approach (not the code), close it, and write the solution yourself. Mark the problem for revision and come back to it a week later.

How long it takes#

Daily timeProblems / dayFull roadmap
1 hour2about 7 to 8 months
1.5 hours3about 5 months
3 hours5 to 6about 3 months

Early phases go much faster than the hard DP and graph problems, so expect your pace to slow down later. Consistency matters more than speed.

Phase 1: Foundations (31 problems)#

Input/output, loops, functions, basic maths, first steps in recursion and hashing. If you have written code before, skim this in a few days, but do not skip it entirely: the maths and recursion problems come back later.

Part 1: Things to know in C++/Java/Python#

  • ☐ 1. User Input / Output · Concept · lesson
  • ☐ 2. Data Types · Concept · lesson
  • ☐ 3. If Else statements · Concept · lesson
  • ☐ 4. Switch Statement · Concept · lesson
  • ☐ 5. What are arrays, strings? · Concept · lesson
  • ☐ 6. For loops · Concept · lesson
  • ☐ 7. While loops · Concept · lesson
  • ☐ 8. Functions (Pass by Reference and Value) · Concept · lesson
  • ☐ 9. Time Complexity · Concept · lesson

Part 2: Build-up Logical Thinking#

  • ☐ 10. Patterns · Concept · lesson

Part 3: Learn STL / Java Collections#

  • ☐ 11. C++ STL · Concept · lesson
  • ☐ 12. Java Collections · Concept · lesson

Part 4: Know Basic Maths#

  • ☐ 13. Count Digits · GFG
  • ☐ 14. Reverse a Number · LeetCode
  • ☐ 15. Check Palindrome · LeetCode
  • ☐ 16. GCD Or HCF · GFG
  • ☐ 17. Armstrong Numbers · GFG
  • ☐ 18. Print all Divisors · GFG
  • ☐ 19. Check for Prime · GFG

Part 5: Learn Basic Recursion#

  • ☐ 20. Understand recursion by print something N times · GFG · lesson
  • ☐ 21. Print name N times using recursion · GFG
  • ☐ 22. Print 1 to N using recursion · GFG
  • ☐ 23. Print N to 1 using recursion · GFG
  • ☐ 24. Sum of first N numbers · GFG
  • ☐ 25. Factorial of N numbers · GFG
  • ☐ 26. Reverse an array · GFG
  • ☐ 27. Check if a string is palindrome or not · LeetCode
  • ☐ 28. Fibonacci Number · LeetCode

Part 6: Learn Basic Hashing#

  • ☐ 29. Hashing Theory · Concept · lesson
  • ☐ 30. Counting frequencies of array elements · GFG
  • ☐ 31. Find the highest/lowest frequency element · GFG

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Phase 2: Sorting (7 problems)#

Seven classic sorting algorithms. Write each one by hand at least once. Merge sort and quick sort are the ones interviewers actually ask about.

Part 1: Sorting-I#

  • ☐ 32. Selection Sort · GFG · lesson
  • ☐ 33. Bubble Sort · GFG · lesson
  • ☐ 34. Insertion Sort · GFG · lesson

Part 2: Sorting-II#

  • ☐ 35. Merge Sort · LeetCode · lesson
  • ☐ 36. Recursive Bubble Sort · GFG · lesson
  • ☐ 37. Recursive Insertion Sort · GFG · lesson
  • ☐ 38. Quick Sort · LeetCode · lesson

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Phase 3: Arrays (40 problems)#

The most important phase for interviews. Easy problems build speed, medium problems teach prefix sums and hashing tricks, and the hard ones teach you to combine ideas.

Part 1: Easy#

  • ☐ 39. Largest Element in an Array · GFG
  • ☐ 40. Second Largest Element in an Array without sorting · GFG
  • ☐ 41. Check if the array is sorted · LeetCode
  • ☐ 42. Remove duplicates from Sorted array · LeetCode
  • ☐ 43. Left Rotate an array by one place · GFG
  • ☐ 44. Left rotate an array by D places · LeetCode
  • ☐ 45. Move Zeros to end · LeetCode
  • ☐ 46. Linear Search · GFG · lesson
  • ☐ 47. Find the Union · GFG
  • ☐ 48. Find missing number in an array · LeetCode
  • ☐ 49. Maximum Consecutive Ones · LeetCode
  • ☐ 50. Find the number that appears once, and other numbers twice · LeetCode
  • ☐ 51. Longest subarray with given sum K (positives) · GFG
  • ☐ 52. Longest subarray with sum K (Positives + Negatives) · GFG

Part 2: Medium#

  • ☐ 53. 2Sum Problem · LeetCode
  • ☐ 54. Sort an array of 0's, 1's and 2's · LeetCode
  • ☐ 55. Majority Element (>n/2 times) · LeetCode
  • ☐ 56. Kadane's Algorithm, maximum subarray sum · LeetCode · lesson
  • ☐ 57. Print subarray with maximum subarray sum · LeetCode
  • ☐ 58. Stock Buy and Sell · LeetCode
  • ☐ 59. Rearrange the array in alternating positive and negative items · LeetCode
  • ☐ 60. Next Permutation · LeetCode
  • ☐ 61. Leaders in an Array · GFG
  • ☐ 62. Longest Consecutive Sequence in an Array · LeetCode
  • ☐ 63. Set Matrix Zeros · LeetCode
  • ☐ 64. Rotate Matrix by 90 degrees · LeetCode
  • ☐ 65. Print the matrix in spiral manner · LeetCode
  • ☐ 66. Count subarrays with given sum · LeetCode

Part 3: Hard#

  • ☐ 67. Pascal's Triangle · LeetCode
  • ☐ 68. Majority Element (n/3 times) · LeetCode
  • ☐ 69. 3-Sum Problem · LeetCode
  • ☐ 70. 4-Sum Problem · LeetCode
  • ☐ 71. Largest Subarray with 0 Sum · GFG
  • ☐ 72. Count number of subarrays with given XOR K · GFG
  • ☐ 73. Merge Overlapping Subintervals · LeetCode
  • ☐ 74. Merge two Sorted Arrays Without Extra Space · LeetCode
  • ☐ 75. Find the repeating and missing number · LeetCode
  • ☐ 76. Count Inversions · GFG
  • ☐ 77. Reverse Pairs · LeetCode
  • ☐ 78. Maximum Product Subarray · LeetCode

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Phase 4: Binary Search (32 problems)#

Three flavours: searching in sorted arrays, binary search on the answer (a pattern that cracks many 'minimum maximum' problems), and searching in 2D matrices.

Part 1: BS on 1D Arrays#

  • ☐ 79. Binary Search to find X in sorted array · LeetCode · lesson
  • ☐ 80. Implement Lower Bound · LeetCode · lesson
  • ☐ 81. Implement Upper Bound · GFG · lesson
  • ☐ 82. Search Insert Position · LeetCode
  • ☐ 83. Floor/Ceil in Sorted Array · GFG
  • ☐ 84. First and last occurrence of a number in a sorted array · LeetCode
  • ☐ 85. Count occurrences of a number in a sorted array with duplicates · GFG
  • ☐ 86. Search in Rotated Sorted Array I · LeetCode
  • ☐ 87. Search in Rotated Sorted Array II · LeetCode
  • ☐ 88. Find minimum in Rotated Sorted Array · LeetCode
  • ☐ 89. Find out how many times the array has been rotated · GFG
  • ☐ 90. Single element in a Sorted Array · LeetCode
  • ☐ 91. Find peak element · LeetCode

Part 2: BS on Answers#

  • ☐ 92. Find square root of a number in log n · LeetCode · lesson
  • ☐ 93. Find the Nth root of a number using binary search · GFG
  • ☐ 94. Koko Eating Bananas · LeetCode
  • ☐ 95. Minimum days to make M bouquets · LeetCode
  • ☐ 96. Find the smallest Divisor given a threshold · LeetCode
  • ☐ 97. Capacity to Ship Packages within D Days · LeetCode
  • ☐ 98. Kth Missing Positive Number · LeetCode
  • ☐ 99. Aggressive Cows · GFG
  • ☐ 100. Book Allocation Problem · GFG
  • ☐ 101. Split array - Largest Sum · LeetCode
  • ☐ 102. Painter's Partition · GFG
  • ☐ 103. Minimize Max Distance to Gas Station · LeetCode (Premium)
  • ☐ 104. Median of 2 sorted arrays · LeetCode
  • ☐ 105. Kth element of 2 sorted arrays · GFG

Part 3: BS on 2D Arrays#

  • ☐ 106. Find the row with maximum number of 1's · LeetCode
  • ☐ 107. Search in a 2D matrix · LeetCode
  • ☐ 108. Search in a row and column wise sorted matrix · LeetCode
  • ☐ 109. Find Peak Element (2D Matrix) · LeetCode
  • ☐ 110. Matrix Median · GFG

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Phase 5: Strings: Basic to Medium (15 problems)#

String manipulation, frequency counting and simple parsing. Pay attention to edge cases like spaces, signs and overflow.

Part 1: Basic and Easy#

  • ☐ 111. Remove outermost Parentheses · LeetCode
  • ☐ 112. Reverse words in a given string · LeetCode
  • ☐ 113. Largest odd number in a string · LeetCode
  • ☐ 114. Longest Common Prefix · LeetCode
  • ☐ 115. Isomorphic String · LeetCode
  • ☐ 116. Check whether one string is a rotation of another · LeetCode
  • ☐ 117. Check if two strings are anagrams · LeetCode

Part 2: Medium#

  • ☐ 118. Sort Characters by frequency · LeetCode
  • ☐ 119. Maximum Nesting Depth of Parentheses · LeetCode
  • ☐ 120. Roman Number to Integer and vice versa · LeetCode
  • ☐ 121. Implement Atoi · LeetCode
  • ☐ 122. Count number of substrings (with exactly K distinct chars) · GFG
  • ☐ 123. Longest Palindromic Substring (without DP) · LeetCode
  • ☐ 124. Sum of Beauty of all substrings · LeetCode
  • ☐ 125. Reverse every word in a string · LeetCode

Phase 6: Linked List (31 problems)#

Pointer manipulation from first principles. Draw every problem on paper before coding; most bugs here are lost pointers.

Part 1: 1D LinkedList#

  • ☐ 126. Introduction to LinkedList · LeetCode · lesson
  • ☐ 127. Inserting a node in LinkedList · GFG · lesson
  • ☐ 128. Deleting a node in LinkedList · LeetCode · lesson
  • ☐ 129. Find the length of the LinkedList · LeetCode
  • ☐ 130. Search an element in the LinkedList · GFG

Part 2: Doubly LinkedList#

  • ☐ 131. Introduction to DLL · GFG · lesson
  • ☐ 132. Insert a node in DLL · GFG
  • ☐ 133. Delete a node in DLL · GFG
  • ☐ 134. Reverse a DLL · GFG

Part 3: Medium Problems of LL#

  • ☐ 135. Middle of a LinkedList (Tortoise-Hare) · LeetCode · lesson
  • ☐ 136. Reverse a LinkedList (Iterative) · LeetCode
  • ☐ 137. Reverse a LinkedList (Recursive) · LeetCode
  • ☐ 138. Detect a loop in LL · LeetCode
  • ☐ 139. Find the starting point of loop in LL · LeetCode
  • ☐ 140. Length of Loop in LL · GFG
  • ☐ 141. Check if LL is palindrome · LeetCode
  • ☐ 142. Segregate odd and even nodes in LL · LeetCode
  • ☐ 143. Remove Nth node from the back of the LL · LeetCode
  • ☐ 144. Delete the middle node of LL · LeetCode
  • ☐ 145. Sort LL · LeetCode
  • ☐ 146. Sort a LL of 0's, 1's and 2's by changing links · GFG
  • ☐ 147. Find the intersection point of Y LL · LeetCode
  • ☐ 148. Add 1 to a number represented by LL · LeetCode (Premium)
  • ☐ 149. Add 2 numbers in LL · LeetCode

Part 4: Medium Problems of DLL#

  • ☐ 150. Delete all occurrences of a key in DLL · GFG
  • ☐ 151. Find pairs with given sum in sorted DLL · GFG
  • ☐ 152. Remove duplicates from sorted DLL · GFG

Part 5: Hard Problems of LL#

  • ☐ 153. Reverse LL in groups of size K · LeetCode
  • ☐ 154. Rotate a LL · LeetCode
  • ☐ 155. Flattening of LL · GFG
  • ☐ 156. Clone a LL with random and next pointer · LeetCode

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Phase 7: Recursion & Backtracking (25 problems)#

Learn the pick / not-pick pattern once and you can solve most subset, combination and permutation problems. The hard part ends with full backtracking puzzles.

Part 1: Get a Strong Hold#

  • ☐ 157. Recursive Implementation of atoi() · LeetCode
  • ☐ 158. Pow(x, n) · LeetCode
  • ☐ 159. Count Good Numbers · LeetCode
  • ☐ 160. Sort a stack using recursion · GFG
  • ☐ 161. Reverse a stack using recursion · GFG

Part 2: Subsequences Pattern#

  • ☐ 162. Generate all binary strings · GFG
  • ☐ 163. Generate Parentheses · LeetCode
  • ☐ 164. Print all subsequences / Power Set · LeetCode
  • ☐ 165. Learn All Patterns of Subsequences (Theory) · Concept · lesson
  • ☐ 166. Count all subsequences with sum K · GFG
  • ☐ 167. Check if there exists a subsequence with sum K · GFG
  • ☐ 168. Combination Sum · LeetCode
  • ☐ 169. Combination Sum II · LeetCode
  • ☐ 170. Subset Sum I · GFG
  • ☐ 171. Subset Sum II · LeetCode
  • ☐ 172. Combination Sum III · LeetCode
  • ☐ 173. Letter Combinations of a Phone Number · LeetCode

Part 3: Trying out all Combos / Hard#

  • ☐ 174. Palindrome Partitioning · LeetCode
  • ☐ 175. Word Search · LeetCode
  • ☐ 176. N Queen · LeetCode
  • ☐ 177. Rat in a Maze · GFG
  • ☐ 178. Word Break · LeetCode
  • ☐ 179. M Coloring Problem · GFG
  • ☐ 180. Sudoku Solver · LeetCode
  • ☐ 181. Expression Add Operators · LeetCode

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Phase 8: Bit Manipulation (18 problems)#

Small but high-value. XOR tricks show up in many interviews, and the sieve problems sharpen your maths.

Part 1: Learn Bit Manipulation#

  • ☐ 182. Introduction to Bit Manipulation (Theory) · Concept · lesson
  • ☐ 183. Check if the i-th bit is set or not · GFG
  • ☐ 184. Check if a number is odd or not · GFG
  • ☐ 185. Check if a number is power of 2 or not · LeetCode
  • ☐ 186. Count the number of set bits · LeetCode
  • ☐ 187. Set/Unset the rightmost unset bit · GFG
  • ☐ 188. Swap two numbers · GFG
  • ☐ 189. Divide two integers without using multiplication, division and mod · LeetCode

Part 2: Interview Problems#

  • ☐ 190. Minimum bit flips to convert A to B · LeetCode
  • ☐ 191. Find the number that appears odd number of times · LeetCode
  • ☐ 192. Power Set (using bits) · LeetCode
  • ☐ 193. Find XOR of numbers from L to R · GFG
  • ☐ 194. Find the two numbers appearing odd number of times · LeetCode

Part 3: Advanced Maths#

  • ☐ 195. Print Prime Factors of a Number · GFG
  • ☐ 196. All Divisors of a Number · GFG
  • ☐ 197. Sieve of Eratosthenes · LeetCode · lesson
  • ☐ 198. Prime Factorisation using Sieve · GFG
  • ☐ 199. Power(n, x) · LeetCode

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Phase 9: Stack & Queue (30 problems)#

Implementations first, then expression conversion, then the monotonic stack pattern that solves 'next greater' and histogram problems.

Part 1: Learning#

  • ☐ 200. Implement Stack using Arrays · GFG · lesson
  • ☐ 201. Implement Queue using Arrays · GFG · lesson
  • ☐ 202. Implement Stack using Queue · LeetCode
  • ☐ 203. Implement Queue using Stack · LeetCode
  • ☐ 204. Implement Stack using LinkedList · GFG
  • ☐ 205. Implement Queue using LinkedList · GFG
  • ☐ 206. Check for balanced parentheses · LeetCode
  • ☐ 207. Implement Min Stack · LeetCode

Part 2: Prefix, Infix, Postfix Conversion#

  • ☐ 208. Infix to Postfix Conversion · GFG · lesson
  • ☐ 209. Prefix to Infix Conversion · GFG
  • ☐ 210. Prefix to Postfix Conversion · GFG
  • ☐ 211. Postfix to Prefix Conversion · GFG
  • ☐ 212. Postfix to Infix Conversion · GFG
  • ☐ 213. Infix to Prefix Conversion · GFG

Part 3: Monotonic Stack/Queue#

  • ☐ 214. Next Greater Element · LeetCode · lesson
  • ☐ 215. Next Greater Element II · LeetCode
  • ☐ 216. Next Smaller Element · GFG
  • ☐ 217. Number of NGEs to the right · GFG
  • ☐ 218. Trapping Rainwater · LeetCode
  • ☐ 219. Sum of subarray minimums · LeetCode
  • ☐ 220. Asteroid Collision · LeetCode
  • ☐ 221. Sum of subarray ranges · LeetCode
  • ☐ 222. Remove K Digits · LeetCode
  • ☐ 223. Largest rectangle in a histogram · LeetCode
  • ☐ 224. Maximal Rectangle · LeetCode

Part 4: Implementation Problems#

Concept lessons for this phase: JioCoder 450 Concepts, Part 1

Continue

Phases 10 to 18 (sliding window, heaps, greedy, trees, BSTs, graphs, DP, tries and advanced strings) are in JioCoder 450 Roadmap, Part 2.

Tips to actually finish#

  • Fix a daily slot. Same time every day beats long weekend sessions.
  • Revise on a schedule. Re-solve marked problems after 3 days, 1 week and 1 month.
  • Keep a notes file. One line per problem: the key idea. Before interviews, read only this file.
  • Don't chase counts. 300 problems you understand beat 450 you copied.
  • For frontend roles, Phases 3 to 6 and 9 to 10 cover most of what gets asked. Do those first if your interviews are close.

Key takeaways#

  • Follow the 18 phases in order; each one builds on the last.
  • Solve every problem in three steps: brute force, better, optimal.
  • Read each phase's concept lessons before solving its problems.
  • Revise on a schedule and keep one-line notes per problem.
  • Consistency beats speed: 2 to 3 problems a day finishes the roadmap in about 5 months.

Article discussion

(0)

Join the discussion — login to comment and help other developers.

Login to comment