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 Algorithms 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: Graph Algorithms Build a practice set

ProblemCourse & topicStatus

ALG:9920201Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920202Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920203Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920204Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920205Let S[0..n-1] end in a unique sentinel \, lexicographically smaller than every other character.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920206A subsequence is obtained by deletions without reordering.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920207A trie for finite dictionary D over a fixed alphabet stores one character per edge, one root path per word prefix,…

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920208Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920209A separate-chaining table has M buckets and n distinct keys, each assigned independently and uniformly.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920210Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920211Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920212A Bloom filter has an initially zero M-bit array and k independent uniform hash functions.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920213A static n-key set is stored by two-level hashing.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920214Randomized Quicksort processes n distinct keys, choosing each recursive pivot uniformly from its subarray.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920215Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920216Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920217Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920218A dynamic array starts with size 0, capacity 1.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920219A k-bit binary counter starts at zero.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920220Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920221A queue uses stacks `In` and `Out`.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920222A dynamic table has size n and power-of-two capacity M, initially n=0,M=1.

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920223Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · Calculation

—

ALG:9920224Mathematical problem title

Graph AlgorithmsAlgorithms Problem Solving

Graph optimization and traversal algorithmsAlgorithms · 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.

Let T[0..n-1] be a text and P[0..m-1] a pattern over the same alphabet, where

1\le

m\le

n.

For pattern P[0..m-1], let

\pi[q]

be the length of the longest proper prefix of P[0..q] that is also its suffix.

For string

S[0..N-1]

, define

Z[0]=N

, and for

i>0

, let

Z[i]

be the maximum

\ell

for which…

For pattern

P[0..m-1]

over finite alphabet

\Sigma

, define automaton states

0,\ldots,m

and…

Map alphabet symbols to

\{0,\ldots,d-1\}

.

Let p be prime,

U=\{0,\ldots,p-1\}

, and

1\le

M\le

p.

An open-address table has M slots and n keys, with

\alpha=n/M<1

.

A stream of distinct items

x_1,\ldots,x_n

, with n unknown in advance and

1\le

k\le

n, is sampled by storing the…

Karger's contraction algorithm receives a connected undirected multigraph on

n\ge2

vertices.

For

n\times n

matrices

A,B,C

over a field, Freivalds' test chooses uniform

r\in\{0,1\}^n

and accepts exactly…

A stack supports PUSH, POP, and MULTIPOP(k), which removes

\min(k,s)

items from current size s.

For planar points

a,b,c

, define

\operatorname{orient}(a,b,c) =(b_x-a_x)(c_y-a_y)-(b_y-a_y)(c_x-a_x)

.

Two closed planar segments have endpoints

p_1,p_2

and

q_1,q_2

.