Introduction to data structures
Choose how to organize data by comparing the work of adding, finding, and removing it.
24 questions
Take quiz
Critical thinking for an AI world
Choose useful data structures, follow algorithms, and reason about the work they do.
Choose from 47 quizzes below. Practice the concepts you need to judge a solution, recognize faulty assumptions, and find errors in logic or code. Every answer includes an explanation and a link back to the relevant tutorial.
Data StructuresChoose how to organize data by comparing the work of adding, finding, and removing it.
24 questions
Take quizPredict how work and memory grow, then choose an approach that fits the job.
24 questions
Take quizTrace array operations, explain their costs, and pick the right collection for a real workload.
24 questions
Take quizFollow the pointers, catch hidden traversal costs, and choose the right kind of list.
24 questions
Take quizTrace LIFO operations, inspect the JavaScript wrapper, and reason about undo, copying, and storage costs.
24 questions
Take quizPredict FIFO behavior, follow linked-list queue operations, and compare ordering and performance tradeoffs.
24 questions
Take quizRead parent-child relationships, calculate height and depth, and decide when a hierarchy fits your data.
24 questions
Take quizDistinguish full, complete, perfect, and balanced trees, and check whether linked nodes form a valid binary tree.
24 questions
Take quizTrace insertion and deletion, check subtree ordering, and explain how tree height affects search.
24 questions
Take quizFollow a priority through array-backed heaps, predict bubbling, and separate heap order from a fully sorted collection.
24 questions
Take quizUse keys and values, recognize collisions, and reason about Map behavior and hash-table lookup costs.
24 questions
Take quizTrace toy hashes, explain collisions and avalanche behavior, and choose hashing tools without confusing a digest with encryption.
24 questions
Take quizBuild shared prefixes, distinguish words from partial matches, and delete entries without damaging their neighbors.
24 questions
Take quizInterpret definite negatives and possible matches, follow bit updates, and weigh memory against unnecessary lookups.
24 questions
Take quizModel directed and undirected relationships, read adjacency lists, and keep edges consistent as a graph changes.
24 questions
Take quizReview legal moves, stored and computed neighbors, and whether two representations describe the same world.
8 questions
Take quizTurn locations into row-column addresses, map clicks to cells, and choose how much detail a grid needs.
24 questions
Take quizTranslate directions into coordinates and keep invalid candidate moves from changing the real position.
24 questions
Take quizSeparate an existing cell from a usable one, trace collision checks, and keep movement and obstacle data consistent.
24 questions
Take quizPredict the search frontier, rebuild routes from breadcrumbs, and explain the limits of shortest-step navigation.
24 questions
Take quizJudge path costs, zero-cost moves, route reconstruction, and the assumptions behind a Dijkstra implementation.
10 questions
Take quizTrace hash changes, reconstruct inclusion proofs, and separate snapshot integrity from trust and freshness.
24 questions
Take quiz
Algorithms BasicsFollow calls down to a base case and back again, then distinguish smaller subproblems from less total work.
24 questions
Take quizCompare repeated recursion, shared memoization, and rolling iteration without confusing call count, depth, or precision.
24 questions
Take quizTrace first-match and all-match searches, reason about equality, and include scan and result-storage costs.
24 questions
Take quizMaintain a valid search interval, trace midpoint decisions, and account for sorting, duplicates, and access costs.
24 questions
Take quizTrack discovery and exploration, compare queue and stack order, and read the returned nodes correctly.
24 questions
Take quizExplore cyclic graphs, distinguish visitation from routes, and select a traversal that matches the task.
24 questions
Take quizPredict worklist changes and separate the lab's visited order, discovery parents, and returned route.
24 questions
Take quizRelax weighted routes, choose the cheapest frontier, and understand when a tentative distance becomes final.
24 questions
Take quizRead tentative-distance snapshots, predict relaxations, and test weighted-route claims with controlled graph changes.
24 questions
Take quiz
Sorting AlgorithmsTrace minimum selection, compare the two collection variants, and weigh comparisons against swaps.
24 questions
Take quizMove active values into a sorted prefix and explain stability, shifts, and nearly sorted inputs.
24 questions
Take quizPartition around a pivot, trace the actual two-pointer code, and reason about balance, stack space, and ties.
24 questions
Take quizFollow adjacent swaps, prove what a quiet pass means, and distinguish swap count from scan cost.
24 questions
Take quizTranslate signed keys into count-table positions without losing numeric order or overlooking range costs.
24 questions
Take quizMerge sorted runs, preserve equal-key order, and account for the real costs of array access and storage.
24 questions
Take quizInspect random shuffles, distinguish expected work from guarantees, and see why luck is not a sorting strategy.
24 questions
Take quizTrack equal-key records, combine sorting passes, and distinguish stable behavior from names and coincidences.
24 questions
Take quizBuild frequency tables, place repeated values, and decide when the key range makes counting worthwhile.
24 questions
Take quizTrace stable digit passes, understand the signed-number wrapper, and separate bucket size from total cost.
24 questions
Take quizRecognize natural runs, follow stable merging, and understand which hybrid-sort details depend on the implementation.
24 questions
Take quizChoose built-in sorts by their contracts, understand hybrid trade-offs, and avoid outdated runtime assumptions.
24 questions
Take quiz
Diving DeeperFind primes by crossing out composites, trace the code, and decide when a sieve is worth its memory.
24 questions
Take quizPlan legal disk moves, follow the recursive calls, and see why a short program can describe an enormous job.
24 questions
Take quizUse informed reveals to reason about switching, check a simulation, and spot when different rules change the odds.
24 questions
Take quizBuild a fractal from smaller triangles, trace its stopping rule, and balance visible detail against growing work.
24 questions
Take quiz
:: Copyright KIRUPA 2026 //--