Skip to main content

Train Courses Problems Proof Blocks Tools Progress Account

⌄

AccountSign-in, membership, and settings Current courseCalculus IThemeAbout ProofAnvilLoading account…

Problem library

Find a problem

Search by course or topic.

Loading the problem library…

TrainCoursesProblemsProgressMoreTrain Courses Problems Progress

More

Proof Blocks Tools Account

ProofAnvil Practice$19 USD monthly · cancel any time

Pricing FAQ Features Roadmap Use with your agent Support Terms Privacy Refunds

Practice problems with hints and solutions · ProofAnvil

Problem library

Find a problem

Search by course or topic.

Search problems

Filters · 2 active

Area

AllMathPhysics

SubjectCourseTopic

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

StatusSkill

Skills match the applied subject and course.

Problem styleFind a private labelPrivate labelPrivate labels are visible only to you.Private labels ready.Favorites

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

Sort

ProblemsClear skill: Sequences Amortized Build a practice set

ProblemCourse & topicStatus

DS:9921051Iterator invalidation.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921052Design a forward iterator for a singly linked list with a dummy head as in Problem 42.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921053Let L be the doubly linked list with values [10, 20, 30, 40, 50], and let I be a bidirectional iterator currently…

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921054Compare iterator categories for sequences.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921055Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921056In-place partition.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921057Stability of sequence transformations.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921058Merge of sorted sequences.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921059(Honors) Amortized analysis of a dynamic array with the grow/shrink policy of Problem 40: double on overflow…

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921060(Honors) Iterator-based zip and flatten.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921061Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921062A stack of elements of type T is represented by a singly linked list whose head is the top of the stack.

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921063Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921064Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921065Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921066A bounded double-ended queue (deque) of capacity m stores elements in an array A[0..m-1] together with integers…

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921067A deque is represented by a doubly linked list with sentinels: a header node H and a trailer node T, with…

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921068Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921069Assume the infix alphabet of tokens \{0,1,2,3,4,5,6,7,8,9,+,-,*,/,{^},(,)\}, where each digit is an operand, {^}…

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921070Evaluate a postfix sequence of integer operands and binary operators from \{+,-,*,/,{^}\} using an operand stack…

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921071Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921072Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921073Mathematical problem title

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

DS:9921074An unbounded array-backed stack stores elements in an array of length m, initially m = 1, together with a size n…

Sequences AmortizedData Structures Problem Solving

Arrays, linked structures, stacks, queues, and amortizationData Structures · Calculation

—

Showing 24 of 50 matching problems.

Private labels

Edit private labels

Add labels that only you can see.

Problem

Current labels

Private labels are unavailable. Close this editor and try again.

New label

Use a short label.

Sequence transformations are specified on an abstract sequence

S=[s_0,s_1,\ldots,s_{n-1}]

.

An array-backed stack of integers uses an array A[0..m-1] and an integer

\mathrm{top}

, with the invariant that the…

A queue of integers is stored in an array A[0..m-1] together with integers

\mathrm{head}

and n, using the…

A bounded queue is implemented as a circular buffer in an array A[0..7] with integers

\mathrm{head}

and

\mathrm{size}

.

A circular buffer occupies an array A[0..m-1] with m

\ge

2 and uses two integer indices

\mathrm{head}

and…

Let

\Sigma

be the alphabet consisting of the six characters ‘(’, ‘)’, ‘[’, ‘]’, ‘{’, ‘}’.

A prefix (Polish) expression over integer operands and the binary operators

\{+,-,*,/\}

is a token sequence…

A queue is implemented with two stacks

\mathrm{In}

and

\mathrm{Out}

, each supporting

\mathrm{PUSH}

,

\mathrm{POP}

…

A stack is implemented with two queues

Q_1

and

Q_2

, each supporting

\mathrm{ENQUEUE}

,

\mathrm{DEQUEUE}

…