Skip to content
ı
Workspace
Workspace
Search anything…
⌘ K
Desk
Path
Problems
Review
More
PICK A CARD. FIND A PATTERN.
Greedy choices, dynamic programming and backtracking
.
500 original challenges. Pick an index card and give it a go.
New problem
All problems
500
Bookmarked
My problems
Filters and order
1 active
Level
All
Level 0
Level 1
Level 2
Level 3
Level 4
Level 5
Level 6
Level 7
Level 8
Difficulty
All
Easy
Medium
Hard
Topic
All topics
Variables, loops, functions and conditionals
Variables and expressions
Conditionals
Loop accumulators
State in a loop
Helper functions
Arrays and strings
Adjacent array positions
String runs
Stable array filtering
Nested array traversal
String scanning
Maps, sets, counting and sorting
Frequency maps
Set membership
Set intersection
Map grouping
Comparator sorting
Two pointers, windows and prefix sums
Opposite-end pointers
Read and write pointers
Fixed sliding windows
Variable sliding windows
Prefix range subtraction
Two sorted streams
Stacks, queues, deques and simulations
Stack cancellation
Monotonic stacks
Queue simulation
Monotonic deques
Stack history
Recursion, sorting, binary search and bits
Divide-and-conquer recursion
Merge sort
Binary search boundaries
Binary search on answers
Bit counting
Prefix bit state
Linked lists, binary trees and search trees
Linked traversal
Linked pointer reversal
Fast and slow pointers
Tree preorder
Tree breadth-first traversal
BST range pruning
Graphs, heaps, union-find and tries
Graph breadth-first distances
Topological queues
Priority-queue shortest paths
Binary heaps
Union-find components
Trie prefix counts
Graph depth-first components
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Counting dynamic programming
Unbounded dynamic programming
Zero-one knapsack
Sequence DP with binary search
Interval dynamic programming
Backtracking choices
Backtracking with occupancy
Scheduling DP and binary search
Status
Any
Solved
Attempted
Unsolved
Order
Path order
Title A–Z
Difficulty
STATUS
PROBLEM
DIFFICULTY
TOPIC
Booking rack: Proof strip
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Total receipt
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Threshold file
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: First qualifying slip
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Peak ticket
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Floor ticket
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Even-key census
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Positive-ink invoice
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Positive proof strip
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Booking rack: Boss receipt
Level 8 · Greedy interval selection
Hard
Greedy choices, dynamic programming and backtracking
Greedy interval selection
Tiling ribbon: Proof strip
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Total receipt
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Threshold file
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: First qualifying slip
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Peak ticket
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Floor ticket
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Even-key census
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Positive-ink invoice
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Positive proof strip
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Tiling ribbon: Boss receipt
Level 8 · Counting dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Counting dynamic programming
Postage drawer: Proof strip
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Total receipt
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Threshold file
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: First qualifying slip
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Peak ticket
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Floor ticket
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Even-key census
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Positive-ink invoice
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Positive proof strip
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Postage drawer: Boss receipt
Level 8 · Unbounded dynamic programming
Hard
Greedy choices, dynamic programming and backtracking
Unbounded dynamic programming
Parcel budget: Proof strip
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Total receipt
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Threshold file
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: First qualifying slip
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Peak ticket
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Floor ticket
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Even-key census
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Positive-ink invoice
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Positive proof strip
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Parcel budget: Boss receipt
Level 8 · Zero-one knapsack
Hard
Greedy choices, dynamic programming and backtracking
Zero-one knapsack
Previous
Page 1 of 3
Next
90 of 500 problems
0 solved
Progress saved on this device
Not sure where to start? Try
the 30-day foundations plan
. One good problem at a time.