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: Dynamic Programming Build a practice set

ProblemCourse & topicStatus

ALG:9920151Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920152Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920153Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920154Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920155Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920156Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920157Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920158Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920159Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920160Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920161Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920162Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920163Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920164Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920165Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920166Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920167Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920168Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920169Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920170Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920171Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920172Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920173Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · Calculation

—

ALG:9920174Mathematical problem title

Dynamic ProgrammingAlgorithms Problem Solving

Dynamic programming and state designAlgorithms · 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.

Given an undirected graph with up to five million vertices, produce exactly the preorder, postorder, parent array,…

Given a directed graph, output ACYCLIC followed by a topological ordering if the graph has no directed cycle.

Given an undirected graph, determine whether it is bipartite.

Given a directed graph, output the lexicographically smallest topological ordering of its vertices, or IMPOSSIBLE…

Given a directed graph on n labeled vertices, count its distinct topological orderings modulo

1{,}000{,}000{,}007

.

Given a directed graph, determine whether it has no topological ordering, exactly one topological ordering, or…

A set of jobs forms a directed acyclic dependency graph.

Given a directed graph, partition its vertices into strongly connected components.

Given a directed graph, form its condensation graph by replacing every strongly connected component with one…

Given a directed graph, add the minimum possible number of directed edges so that the resulting graph is strongly…

A Boolean formula is a conjunction of clauses, each containing one or two literals over variables

x_1

through

x_n

.

Given a directed graph, output all vertices from which every graph vertex is reachable by a directed path.

Given a simple undirected graph, output all articulation vertices in increasing order and all bridges in…

Given an undirected multigraph, delete every bridge and partition the remaining vertices into maximal…

Given a simple undirected graph, find all maximal vertex-biconnected blocks and construct its block-cut forest.

Given an undirected multigraph and q vertex pairs (s,t), report for each pair the number of edges whose individual…

For every vertex v of an undirected graph, determine the number of connected components that would remain after…

Given an undirected graph and q independent queries (a,b,x), determine whether a and b are connected after vertex…

Given a directed unweighted graph, a source s, and claimed distance and parent values for every vertex, design a…

Given a directed graph in adjacency-list form, design an algorithm that outputs its depth-first forest, strongly…

Let G=(V,E) be a connected, undirected graph with real edge weights, and let S be a nonempty proper subset of V.

Let G=(V,E) be a connected, undirected weighted graph, and let C be a cycle in G.

Kruskal’s algorithm processes the edges of a connected weighted graph in nondecreasing order, adding an edge…

Prim’s algorithm starts at an arbitrary root and repeatedly adds a minimum-weight edge with exactly one endpoint…