Problem library

Find a problem

Search by course or topic.

Search problems

Clear

Filters · 1 active

Area

AllMathPhysics

SubjectCourseTopic

Topic choices for Data Structures are shortened. Search still covers every problem.

StatusSkillProblem styleFind a private labelPrivate labelFavorites

Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available.

Progress labels

IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due

Problem results

ProblemsBuild a practice set

DS:010217A wraparound write fills stale slots; size, not head-equals-tail, decides full versus empty

DS Circular Buffer Wrap SizeDS Circular Buffer Physical VS Logical

Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review

DS:010218A duplicate minimum must sit on the min-stack, or one pop forgets the other

DS Min Stack Duplicate RuleDS Min Stack Restore Trace

Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review

DS:010219A two-stack queue is FIFO by an out-then-in reading, and two times in-size pays for every transfer

DS Two Stack Fifo InvariantDS Two Stack Fifo Potential

Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review

DS:010220A persistent push allocates one node and shares the old spine

DS Persistent Stack SharingDS Persistent Stack Node Count

Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review

DS:010221A stable in-place list partition relinks existing nodes and does not need a sentinel

DS Stable List PartitionDS List Partition Node Identity

Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review

DS:010322A two-child BST delete must splice the successor, not promote the right child

Bst Inorder Successor Two Child DeleteBst Parent Pointer Transplant

Search trees and balanced treesData Structures · Mixed review

DS:010323A t=2 B-tree insert splits the full leaf on 40 before writing 35

Btree Preemptive Full Node SplitBtree Occupancy And Search Path

Search trees and balanced treesData Structures · Mixed review

DS:010324Deleting car only clears a terminal; deleting cat prunes a leaf

Trie Shared Prefix ConstructionTrie Delete Terminal Versus Prune

Search trees and balanced treesData Structures · Mixed review

DS:010425A linear-probe delete is a tombstone; insert 45 remembers slot 4

Linear Probe Wraparound PlacementTombstone Search And Duplicate Safe Insert

Hash tables and probabilistic performanceData Structures · Mixed review

DS:010426Three keys that share only A0 and B0 force a cuckoo rehash

Cuckoo Two Cell Lookup ContractCuckoo Placement Graph Component Bound

Hash tables and probabilistic performanceData Structures · Mixed review

DS:010527Bottom-up heap construction is linear because most subtrees are short

DS Bottom UP Heapify TraceDS Heap Build Linear Height Sum

Heaps, priority queues, and disjoint setsData Structures · Mixed review

DS:010528Decrease-key in an indexed min-heap must restore heap order and the inverse position map

DS Indexed Decrease Key SiftDS Heap Pos Inverse Identity

Heaps, priority queues, and disjoint setsData Structures · Mixed review

DS:010529Binomial-heap meld adds degree vectors, including a three-tree carry

DS Binomial Tree BK FactsDS Binomial Meld Three Carry

Heaps, priority queues, and disjoint setsData Structures · Mixed review

DS:010630Multi-source BFS distances depend on the source set, not on parent choices

DS Multisource Bfs DistanceDS Bfs Mark ON Enqueue

Graph representations and traversalsData Structures · Mixed review

DS:010631Recursive DFS is simulated by frames, not by an eager vertex stack

DS Iterative Dfs FramesDS Dfs Parent Disagreement

Graph representations and traversalsData Structures · Mixed review