DSA Question Bank — 150 Exam & Interview Questions with Answers

You don't fail DSA exams or interview screens because you never read about hash tables. You fail because you can't trace, analyze and explain under time pressure. That's a drilling problem — and this is the drill.150 questions in the formats exams and screens actually use:• 30 Big-O & arrays/lists — analyze real code snippets, amortized analysis, trace operations• 25 stacks, queues & hashing — mechanics, collisions, load factor, "which structure for X" scenarios• 35 trees & heaps — BST insert/delete traces, traversal outputs, AVL rotation identification, heap operations• 25 graphs — BFS/DFS visit orders, Dijkstra step traces, topological sort, cycle detection• 35 sorting, recursion & DP — identify the sort from a partial trace, stability, recurrences, memoization vs tabulationEvery answer is verified (44 trace answers executed in Python before publishing) and explained in 2-4 sentences — enough to understand, short enough to drill. Difficulty-rated ★ to ★★★ with a spaced-repetition study plan in the README.Learn the concepts in our Algorithms & Data Structures — Visually Explained book, then drill them here: https://generalistprogrammer.gumroad.com/l/algorithms-visually-explainedWhat you get: the full question bank + answer key as PDF and Markdown. Lifetime updates.

Found on Devadex — the discovery index for independent software the big search engines bury. More from gumroad.

Report this listing