Menu

The 150 DSA problems I'd actually do before a coding interview (Java & Python)
πŸ“°

The 150 DSA problems I'd actually do before a coding interview (Java & Python)

DEV Community: javaΒ·Code NotesΒ·about 10 hours ago
#PTJ8hkpK
#devtojava#devto#dev#lists#list
Reading 0:00
15s threshold

Most "interview prep" lists are 500 problems long. Nobody finishes them. Interviewers at most companies test the same ~15 patterns again and again, so a short list that covers every pattern beats a long list that covers the same one ten times.

Here's how I'd group a 150-problem plan:

Arrays & hashing (20) β€” two-sum style lookups, counting, prefix sums.

Two pointers & sliding window (20) β€” sorted arrays, longest/shortest substring problems.

Stacks & queues (10) β€” valid brackets, next greater element, monotonic stack.

Binary search (10) β€” not just "find x": search on the answer.

Linked lists (10) β€” reverse, merge, cycle detection.

Trees (20) β€” DFS/BFS, BST checks, lowest common ancestor.

Heaps (8) β€” top-k, merge k lists, running median.

Graphs (15) β€” BFS shortest path, islands, topological sort, union-find.

Backtracking (10) β€” subsets, permutations, N-Queens.

Dynamic programming (22) β€” 1D (climbing stairs, house robber), 2D (grid paths, LCS), knapsack.

Greedy & intervals (5) β€” merge intervals,…

Continue reading β€” create a free account

Join HashtagPLUS to read full articles, follow hashtags, vote, and join the conversation.