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

ProblemCourse & topicStatus

ALG:9920101Mathematical problem title

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920102Consider the invalid coding rule that repeatedly combines the two partial trees of largest total frequency instead…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920103For an undirected graph G=(V,E), let a subset of E be independent exactly when it contains no cycle.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920104Mathematical problem title

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920105Let E be a finite indexed collection of vectors over a field, and call a subset independent when its vectors are…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920106Mathematical problem title

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920107Let M=(E,\mathcal I) be a matroid with an arbitrary real weight on each element.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920108Let (E,\mathcal I) be a nonempty hereditary independence system.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920109For a fixed finite collection of intervals, call a subcollection independent when its intervals are pairwise…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920110For an undirected graph, call an edge set independent when it is a matching.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920111In set cover, consider the rule that repeatedly chooses a set containing the largest number of currently uncovered…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920112Mathematical problem title

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920113Given a sequence of n integers, find a longest subsequence whose consecutive differences are nonzero and alternate…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920114Given strings A and B and nonnegative insertion, deletion, and substitution costs, transform A into B with minimum…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920115Given a string S, partition it into the fewest nonempty contiguous substrings such that each substring is a…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920116There are n coin types.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920117Items are divided into g ordered groups.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920118Each of n items has a weight, volume, and value.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920119Given n items with positive weights and integer values and capacity C, choose a subset of total weight at most C.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920120There are n package types.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920121Given an array A of n integers, divide it into exactly m nonempty contiguous segments.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920122Given three strings A,B,C, find a longest string that is a subsequence of all three.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920123Given strings A and B, find a shortest string S such that both A and B are subsequences of S.

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · Calculation

—

ALG:9920124Given strings A,B,T, determine how many source-choice sequences form T by interleaving all characters of A and B…

GreedyAlgorithms Problem Solving

Greedy algorithms and exchange proofsAlgorithms · 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.

Fix an integer

D\ge3

.

Let a finite ground set E be partitioned into blocks

B_1,\ldots,B_k

, with capacities

q_1,\ldots,q_k

.

Each unit-time job j has an integer deadline

d_j\in\{1,\ldots,D\}

, and a set of jobs is feasible when its jobs can…

Given an array of

n

integers, choose exactly

k

indices

i_1<i_2<\cdots<i_k

such that

i_{j+1}-i_j\ge d

for…