Computing
Algorithms
Train on Algorithms with 315 published problems. Preview a problem, explore the course outline, and work through one problem at a time.
Training
Start training
Course and path
Available problems completed
View progressLoading course progress…
Preview a course problem
See a problem from Algorithms before you begin.
Course topics
Course topics
Correctness proofs and asymptotic complexity
Divide-and-conquer algorithms
Greedy algorithms and exchange proofs
Dynamic programming and state design
Graph optimization and traversal algorithms
Reductions, NP-completeness, and approximation
Practice problems
Try a few Algorithms problems, each with a hint.
- Let all logarithms have base 2, and let all functions have domain the positive integers Free with an accountCorrectness proofs and asymptotic complexity
- There are n jobs in fixed order with positive integer sizes s₁,…,sₙ, and d ≥ 1… Free with an accountCorrectness proofs and asymptotic complexity
- Two disjoint color classes contain r ≥ 1 red and b ≥ 1 blue planar points Divide-and-conquer algorithms
- Using only comparisons, return both minimum and maximum among n ≥ 1 distinct keys Divide-and-conquer algorithms
- Consider the invalid coding rule that repeatedly combines the two partial trees of… Greedy algorithms and exchange proofs
- The n vertices of a cycle are numbered 1,…,n, and vertex i has an integer weight Greedy algorithms and exchange proofs
- Given an undirected graph with up to five million vertices, produce exactly the… Dynamic programming and state design
- Prim’s algorithm starts at an arbitrary root and repeatedly adds a minimum-weight edge… Dynamic programming and state design
- Let T[0..n-1] be a text and P[0..m-1] a pattern over the same alphabet, where 1 ≤ m ≤ n Graph optimization and traversal algorithms
- Consider SET COVER parameterized by the universe size p=|U|, while the number m of… Reductions, NP-completeness, and approximation