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 2)

Part 2 of the JioCoder 450 DSA roadmap: Phases 10 to 18 with a to-do box and LeetCode/GFG link for problems 230 to 454, from sliding window to graphs and DP.

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

This is Part 2 of the JioCoder 450 DSA Roadmap, covering Phases 10 to 18: problems 230 to 454. Read Part 1 first for how to use the checklist and how to approach each problem.

Phase 10: Sliding Window & Two Pointers (12 problems)#

Short phase, very common in interviews. Master the shrink-the-window template and the 'at most K minus at most K-1' trick.

Part 1: Medium#

  • ☐ 230. Longest Substring Without Repeating Characters · LeetCode · lesson
  • ☐ 231. Max Consecutive Ones III · LeetCode
  • ☐ 232. Fruit Into Baskets · LeetCode
  • ☐ 233. Longest Repeating Character Replacement · LeetCode
  • ☐ 234. Binary Subarrays With Sum · LeetCode
  • ☐ 235. Count Number of Nice Subarrays · LeetCode
  • ☐ 236. Number of Substrings Containing All Three Characters · LeetCode
  • ☐ 237. Maximum Points You Can Obtain from Cards · LeetCode

Part 2: Hard#

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

Phase 11: Heaps (17 problems)#

Priority queues for top-K, merging and streaming problems.

Part 1: Learning#

  • ☐ 242. Introduction to Priority Queues using Binary Heaps · GFG · lesson
  • ☐ 243. Min Heap and Max Heap Implementation · GFG · lesson
  • ☐ 244. Check if an array represents a min-heap · GFG
  • ☐ 245. Convert Min Heap to Max Heap · GFG

Part 2: Medium#

  • ☐ 246. Kth largest element in an array · LeetCode
  • ☐ 247. Kth smallest element in an array · GFG
  • ☐ 248. Sort K sorted array · GFG
  • ☐ 249. Merge M sorted Lists · LeetCode
  • ☐ 250. Replace each array element by its rank · LeetCode
  • ☐ 251. Task Scheduler · LeetCode
  • ☐ 252. Hand of Straights · LeetCode

Part 3: Hard#

  • ☐ 253. Design Twitter · LeetCode
  • ☐ 254. Connect N ropes with minimal cost · LeetCode (Premium)
  • ☐ 255. Kth largest element in a stream · LeetCode
  • ☐ 256. Maximum Sum Combination · GFG
  • ☐ 257. Find Median from Data Stream · LeetCode
  • ☐ 258. K most frequent elements · LeetCode

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

Phase 12: Greedy (16 problems)#

Interval scheduling and local-choice problems. Always ask yourself why the greedy choice is safe.

Part 1: Easy#

  • ☐ 259. Assign Cookies · LeetCode
  • ☐ 260. Fractional Knapsack · GFG
  • ☐ 261. Minimum number of coins · GFG
  • ☐ 262. Lemonade Change · LeetCode
  • ☐ 263. Valid Parenthesis Checker · LeetCode

Part 2: Medium/Hard#

  • ☐ 264. N meetings in one room · GFG
  • ☐ 265. Jump Game · LeetCode
  • ☐ 266. Jump Game II · LeetCode
  • ☐ 267. Minimum number of platforms for a railway · GFG
  • ☐ 268. Job Sequencing Problem · GFG
  • ☐ 269. Candy · LeetCode
  • ☐ 270. Shortest Job First (SJF) CPU Scheduling · GFG
  • ☐ 271. LRU Page Replacement Algorithm · GFG
  • ☐ 272. Insert Interval · LeetCode
  • ☐ 273. Merge Intervals · LeetCode
  • ☐ 274. Non-overlapping Intervals · LeetCode

Phase 13: Binary Trees (39 problems)#

Traversals first, then height, diameter and views, then construction and Morris traversal. Recursion skills from phase 7 pay off here.

Part 1: Traversals#

  • ☐ 275. Introduction to Trees · Concept · lesson
  • ☐ 276. Binary Tree Representation in C++ · Concept · lesson
  • ☐ 277. Binary Tree Representation in Java · Concept · lesson
  • ☐ 278. Binary Tree Traversals · Concept · lesson
  • ☐ 279. Preorder Traversal · LeetCode
  • ☐ 280. Inorder Traversal · LeetCode
  • ☐ 281. Postorder Traversal · LeetCode
  • ☐ 282. Level Order Traversal · LeetCode · lesson
  • ☐ 283. Iterative Preorder Traversal · LeetCode
  • ☐ 284. Iterative Inorder Traversal · LeetCode
  • ☐ 285. Postorder Traversal using 2 stacks · LeetCode
  • ☐ 286. Postorder Traversal using 1 stack · LeetCode
  • ☐ 287. Pre, In, Post order in one traversal · LeetCode

Part 2: Medium Problems#

  • ☐ 288. Height of a Binary Tree · LeetCode
  • ☐ 289. Check if Binary Tree is height-balanced · LeetCode
  • ☐ 290. Diameter of Binary Tree · LeetCode
  • ☐ 291. Maximum Path Sum · LeetCode
  • ☐ 292. Check if two trees are identical · LeetCode
  • ☐ 293. Zig Zag Traversal · LeetCode
  • ☐ 294. Boundary Traversal · LeetCode (Premium)
  • ☐ 295. Vertical Order Traversal · LeetCode
  • ☐ 296. Top View of Binary Tree · GFG
  • ☐ 297. Bottom View of Binary Tree · GFG
  • ☐ 298. Right/Left View of Binary Tree · LeetCode
  • ☐ 299. Symmetric Binary Tree · LeetCode

Part 3: Hard Problems#

  • ☐ 300. Root to Node Path in Binary Tree · GFG
  • ☐ 301. LCA in Binary Tree · LeetCode
  • ☐ 302. Maximum width of a Binary Tree · LeetCode
  • ☐ 303. Check for Children Sum Property · GFG
  • ☐ 304. Print all nodes at distance K · LeetCode
  • ☐ 305. Minimum time to burn the Binary Tree from a node · LeetCode
  • ☐ 306. Count nodes in a Complete Binary Tree · LeetCode
  • ☐ 307. Requirements to construct a unique Binary Tree (Theory) · Concept · lesson
  • ☐ 308. Construct Binary Tree from Inorder and Preorder · LeetCode
  • ☐ 309. Construct Binary Tree from Inorder and Postorder · LeetCode
  • ☐ 310. Serialize and Deserialize Binary Tree · LeetCode
  • ☐ 311. Morris Preorder Traversal · LeetCode
  • ☐ 312. Morris Inorder Traversal · LeetCode · lesson
  • ☐ 313. Flatten Binary Tree to LinkedList · LeetCode

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

Phase 14: Binary Search Trees (16 problems)#

Use the sorted property: most BST problems are a tree version of binary search or an inorder traversal.

Part 1: Concepts#

  • ☐ 314. Introduction to BST · Concept · lesson
  • ☐ 315. Search in a BST · LeetCode
  • ☐ 316. Find Min/Max in BST · GFG

Part 2: Practice Problems#

  • ☐ 317. Ceil in a BST · GFG
  • ☐ 318. Floor in a BST · GFG
  • ☐ 319. Insert a node in BST · LeetCode
  • ☐ 320. Delete a node in BST · LeetCode
  • ☐ 321. Kth smallest/largest element in BST · LeetCode
  • ☐ 322. Check if a tree is a BST · LeetCode
  • ☐ 323. LCA in BST · LeetCode
  • ☐ 324. Construct BST from Preorder Traversal · LeetCode
  • ☐ 325. Inorder Successor/Predecessor in BST · LeetCode (Premium)
  • ☐ 326. BST Iterator · LeetCode
  • ☐ 327. Two Sum in BST · LeetCode
  • ☐ 328. Recover BST (two nodes swapped) · LeetCode
  • ☐ 329. Largest BST in Binary Tree · LeetCode (Premium)

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

Phase 15: Graphs (54 problems)#

BFS and DFS, topological sort, shortest paths, minimum spanning trees and disjoint sets. The longest phase after DP, so pace yourself.

Part 1: Learning#

  • ☐ 330. Graph and Types · Concept · lesson
  • ☐ 331. Graph Representation (C++) · Concept · lesson
  • ☐ 332. Graph Representation (Java) · Concept · lesson
  • ☐ 333. Connected Components · GFG · lesson
  • ☐ 334. BFS · GFG · lesson
  • ☐ 335. DFS · GFG · lesson

Part 2: Problems on BFS/DFS#

  • ☐ 336. Number of Provinces · LeetCode
  • ☐ 337. Connected Components in Matrix (Number of Islands) · LeetCode
  • ☐ 338. Rotten Oranges · LeetCode
  • ☐ 339. Flood Fill · LeetCode
  • ☐ 340. Cycle Detection in Undirected Graph (BFS) · GFG · lesson
  • ☐ 341. Cycle Detection in Undirected Graph (DFS) · GFG
  • ☐ 342. 0/1 Matrix (Distance of nearest 1) · LeetCode
  • ☐ 343. Surrounded Regions · LeetCode
  • ☐ 344. Number of Enclaves · LeetCode
  • ☐ 345. Word Ladder I · LeetCode
  • ☐ 346. Word Ladder II · LeetCode
  • ☐ 347. Number of Distinct Islands · LeetCode (Premium)
  • ☐ 348. Bipartite Graph (DFS) · LeetCode
  • ☐ 349. Cycle Detection in Directed Graph (DFS) · GFG · lesson

Part 3: Topo Sort Problems#

  • ☐ 350. Topological Sort (DFS) · GFG · lesson
  • ☐ 351. Kahn's Algorithm (BFS) · GFG · lesson
  • ☐ 352. Cycle Detection in Directed Graph (BFS) · GFG
  • ☐ 353. Course Schedule I · LeetCode
  • ☐ 354. Course Schedule II · LeetCode
  • ☐ 355. Find Eventual Safe States · LeetCode
  • ☐ 356. Alien Dictionary · LeetCode (Premium)

Part 4: Shortest Path Algorithms#

  • ☐ 357. Shortest Path in UG with unit weights · GFG
  • ☐ 358. Shortest Path in DAG · GFG
  • ☐ 359. Dijkstra's Algorithm · GFG · lesson
  • ☐ 360. Why Priority Queue in Dijkstra's · GFG · lesson
  • ☐ 361. Shortest path in a binary maze · LeetCode
  • ☐ 362. Path with minimum effort · LeetCode
  • ☐ 363. Cheapest Flights within K Stops · LeetCode
  • ☐ 364. Network Delay Time · LeetCode
  • ☐ 365. Number of ways to arrive at destination · LeetCode
  • ☐ 366. Minimum multiplications to reach end · GFG
  • ☐ 367. Bellman Ford Algorithm · GFG · lesson
  • ☐ 368. Floyd Warshall Algorithm · GFG · lesson
  • ☐ 369. City with smallest number of neighbours at threshold distance · LeetCode

Part 5: MST / Disjoint Set#

  • ☐ 370. Minimum Spanning Tree (Theory) · GFG · lesson
  • ☐ 371. Prim's Algorithm · LeetCode · lesson
  • ☐ 372. Disjoint Set (Union by Rank) · GFG · lesson
  • ☐ 373. Disjoint Set (Union by Size) · GFG · lesson
  • ☐ 374. Kruskal's Algorithm · LeetCode · lesson
  • ☐ 375. Number of operations to make network connected · LeetCode
  • ☐ 376. Most stones removed with same row or column · LeetCode
  • ☐ 377. Accounts Merge · LeetCode
  • ☐ 378. Number of Islands II · LeetCode (Premium)
  • ☐ 379. Making a Large Island · LeetCode
  • ☐ 380. Swim in Rising Water · LeetCode

Part 6: Other Algorithms#

  • ☐ 381. Bridges in Graph · LeetCode · lesson
  • ☐ 382. Articulation Point in Graph · GFG · lesson
  • ☐ 383. Kosaraju's Algorithm (SCC) · GFG · lesson

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

Phase 16: Dynamic Programming (56 problems)#

Start every problem with plain recursion, add memoisation, then convert to tabulation and space optimisation. Covers 1D, grids, subsequences, strings, stocks, LIS and partition DP.

Part 1: Introduction#

  • ☐ 384. Dynamic Programming Introduction · Concept · lesson

Part 2: 1D DP#

  • ☐ 385. Climbing Stairs · LeetCode
  • ☐ 386. Frog Jump · GFG
  • ☐ 387. Frog Jump with K distances · GFG
  • ☐ 388. Maximum sum of non-adjacent elements · LeetCode
  • ☐ 389. House Robber · LeetCode

Part 3: 2D/3D DP and DP on Grids#

  • ☐ 390. Ninja's Training · GFG
  • ☐ 391. Grid Unique Paths · LeetCode
  • ☐ 392. Unique Paths II · LeetCode
  • ☐ 393. Minimum path sum in Grid · LeetCode
  • ☐ 394. Minimum path sum in Triangular Grid · LeetCode
  • ☐ 395. Minimum/Maximum Falling Path Sum · LeetCode
  • ☐ 396. 3D DP: Cherry Pickup · LeetCode

Part 4: DP on Subsequences#

  • ☐ 397. Subset sum equal to target · GFG
  • ☐ 398. Partition Equal Subset Sum · LeetCode
  • ☐ 399. Partition into 2 subsets with min absolute sum diff · LeetCode
  • ☐ 400. Count Subsets with Sum K · GFG
  • ☐ 401. Count Partitions with Given Difference · GFG
  • ☐ 402. 0/1 Knapsack · GFG
  • ☐ 403. Minimum Coins · LeetCode
  • ☐ 404. Target Sum · LeetCode
  • ☐ 405. Coin Change II · LeetCode
  • ☐ 406. Unbounded Knapsack · GFG
  • ☐ 407. Rod Cutting Problem · GFG

Part 5: DP on Strings#

  • ☐ 408. Longest Common Subsequence · LeetCode
  • ☐ 409. Print Longest Common Subsequence · GFG
  • ☐ 410. Longest Common Substring · GFG
  • ☐ 411. Longest Palindromic Subsequence · LeetCode
  • ☐ 412. Minimum insertions to make string palindrome · LeetCode
  • ☐ 413. Minimum Insertions/Deletions to convert string · LeetCode
  • ☐ 414. Shortest Common Supersequence · LeetCode
  • ☐ 415. Distinct Subsequences · LeetCode
  • ☐ 416. Edit Distance · LeetCode
  • ☐ 417. Wildcard Matching · LeetCode

Part 6: DP on Stocks#

  • ☐ 418. Best Time to Buy and Sell Stock · LeetCode
  • ☐ 419. Buy and Sell Stock II · LeetCode
  • ☐ 420. Buy and Sell Stock III · LeetCode
  • ☐ 421. Buy and Sell Stock IV · LeetCode
  • ☐ 422. Buy and Sell Stock with Cooldown · LeetCode
  • ☐ 423. Buy and Sell Stock with Transaction Fee · LeetCode

Part 7: DP on LIS#

  • ☐ 424. Longest Increasing Subsequence · LeetCode
  • ☐ 425. Print Longest Increasing Subsequence · GFG
  • ☐ 426. LIS using Binary Search · LeetCode
  • ☐ 427. Largest Divisible Subset · LeetCode
  • ☐ 428. Longest String Chain · LeetCode
  • ☐ 429. Longest Bitonic Subsequence · GFG
  • ☐ 430. Number of Longest Increasing Subsequences · LeetCode

Part 8: MCM DP / Partition DP#

  • ☐ 431. Matrix Chain Multiplication · GFG
  • ☐ 432. Matrix Chain Multiplication Bottom-Up · GFG
  • ☐ 433. Minimum Cost to Cut the Stick · LeetCode
  • ☐ 434. Burst Balloons · LeetCode
  • ☐ 435. Evaluate Boolean Expression to True · GFG
  • ☐ 436. Palindrome Partitioning II · LeetCode
  • ☐ 437. Partition Array for Maximum Sum · LeetCode

Part 9: DP on Squares#

  • ☐ 438. Maximum Rectangle Area with all 1's · LeetCode
  • ☐ 439. Count Square Submatrices with All Ones · LeetCode

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

Phase 17: Tries (7 problems)#

Prefix trees for word problems and the bitwise trie for maximum XOR questions.

Part 1: Theory#

  • ☐ 440. Implement Trie (Insert, Search, StartsWith) · LeetCode · lesson

Part 2: Problems#

  • ☐ 441. Implement Trie II (Prefix Count) · LeetCode (Premium)
  • ☐ 442. Longest String with All Prefixes · LeetCode (Premium)
  • ☐ 443. Number of Distinct Substrings in a String · GFG
  • ☐ 444. Power Set (Bit Manipulation) · LeetCode
  • ☐ 445. Maximum XOR of two numbers in an array · LeetCode
  • ☐ 446. Maximum XOR with an element from an array · LeetCode

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

Phase 18: Strings: Advanced Algorithms (8 problems)#

Pattern matching with hashing, Z-function and KMP. Rarely needed for frontend roles, so treat this as optional.

Part 1: Hard#

  • ☐ 447. Minimum bracket reversals to make expression balanced · GFG
  • ☐ 448. Count and Say · LeetCode
  • ☐ 449. Hashing in Strings (Theory) · Concept · lesson
  • ☐ 450. Rabin Karp Algorithm · LeetCode · lesson
  • ☐ 451. Z-Function · LeetCode · lesson
  • ☐ 452. KMP Algorithm / LPS (pi) array · LeetCode · lesson
  • ☐ 453. Shortest Palindrome · LeetCode
  • ☐ 454. Longest Happy Prefix · LeetCode

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

Key takeaways#

  • Phases 10 to 18 build directly on recursion, stacks and binary search from Part 1.
  • Learn BFS and DFS well; most graph problems are one of the two with a twist.
  • Approach every DP problem as recursion first, then memoise, then tabulate.
  • For frontend roles, Phases 10 and 13 matter most in this half.
  • Use the concept lessons in Concepts Part 2 before each phase.

Article discussion

(0)

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

Login to comment