Year 2 · Semester 4 · 200 Hours

Advanced DSA — Graphs · DP · Tries · Hard Patterns

DSA is the ONLY coding focus · +50 LeetCode (Total: 150) · After this: can pass TCS NQT + Infosys written

200

Total Hours

150

LeetCode Cumulative

+50

New (Medium + Hard)

25 min

Target: Medium Problem

Modules & Topics

Graph representation — adjacency list vs matrix

BFS — level-by-level; DFS — recursive and iterative

Cycle detection; Topological sort — Kahn's + DFS-based

Dijkstra's shortest path with priority queue; Union-Find (DSU)

Assignments

Graph traversal visualizer · Pathfinding on a grid — shortest path

LeetCode

#200 Number of Islands#207 Course Schedule#743 Network Delay Time#127 Word Ladder#269 Alien Dictionary

DP mindset — overlapping subproblems + optimal substructure

1D DP — fibonacci, climbing stairs, house robber, coin change

2D DP — grid problems, LCS, knapsack, partition

DP on strings — edit distance, palindrome partitioning

Assignments

Solve every classic DP problem both ways (memo + tabulation)

LeetCode

#322 Coin Change#300 LIS#1143 LCS#416 Partition Equal Subset#72 Edit Distance#10 Regex Matching

Monotonic stack — next greater element, daily temperatures

Binary search on answer; bit manipulation tricks

Trie — structure, insert, search; Segment trees and Fenwick trees

Assignments

Implement Trie with insert/search/startsWith · Segment tree with range sum

LeetCode

#215 Kth Largest#42 Trapping Rain Water#84 Largest Rectangle#208 Implement Trie#307 Range Sum Query

Weekly timed contests — 4 problems, 90 min, Codeforces/LeetCode format

Mock interviews — 45 min each, DSA + behavioral

Company-specific — TCS NQT, Infosys SP, Wipro NLTH

Assignments

150 LeetCode total · Can solve medium in 25 min · Mock interview score 7+/10

LeetCode

#23 Merge K Sorted Lists#295 Find Median from Data Stream#4 Median of Two Sorted Arrays#329 Longest Increasing Path