Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,386 problems

Cube IV (Small)
Medium4
DFS, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Manage your Energy (Small)
Medium4
Dynamic programming
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Ocean View
Medium4
Dynamic programming
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Quake Live Team Split
Medium4
Dynamic programming, Brute force
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Welcome to Code Jam (Small)
Medium4
Dynamic programming, String
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Road Network of a Perfect Binary Tree
Medium4
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Candy
Medium4
Combinatorics, Math+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Partitioning a Queue
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Combinations
Medium4
Combinatorics, Math+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Lab Schedule
Medium4
Dynamic programming, Greedy
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Hamlet
Medium4
Dynamic programming, Probability+2
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Minimum energy × delay product
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Hidden Palindrome
Medium4
Dynamic programming, String+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
The nearest convenience store
Medium4
Graph, Shortest path+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Box Packing
Medium4
Dynamic programming, Binary search+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Stretch Rope (Small)
Medium4
Brute force, Array+2
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Safe Squares (Small)
Medium4
Dynamic programming, Matrix+2
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Resource Mining
Medium4
Dynamic programming, Matrix+2
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Prerequisite Courses
Medium4
Graph, Topological sort+2
No attempts yet
Time limit
5s
Memory limit
256 MB
Judgeable
Image quilting (large)
Medium4
Dynamic programming, Matrix+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Pizza (Large)
Medium4
Greedy, Math+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Chonggang Chonggang
Medium4
Shortest path, Graph+2
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Multiples of three from 0, 1, and 2 (Large)
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
The TA is a sadist!!
Medium4
Dynamic programming, Binary search+2
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Milk Festival
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Frog Leaps
Medium4
Greedy, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Irrational Division
Medium4
Game theory, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Counting paths
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Secret of Chocolate Poles
Medium4
Dynamic programming, Combinatorics
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Maximum of A[j]-A[i]+A[l]-A[k]
Medium4
Dynamic programming, Array+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
1, 2, 3 Sum 3
Medium4
Dynamic programming, Math+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
One, Two, Three Plus Four
Medium4
Dynamic programming, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Überwatch
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Coolest Ski Route
Medium4
Graph, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Combination
Medium4
Math, Number theory+2
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Gun Control
Medium4
Dynamic programming, Array
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Collecting Energy
Medium4
Dynamic programming, Recursion+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
String Discrimination
Medium4
Dynamic programming, String+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
I'm Sick of Fibonacci~
Medium4
Dynamic programming, Recursion+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Making a Password
Medium4
String, Brute force+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
My Life Has Math in It
Medium4
Dynamic programming, Implementation+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Viyott's Stepping Stone Crossing
Medium4
Math, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Arranging Soldiers
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
RUN
Medium4
Graph, Shortest path+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Digit Sum
Medium4
Dynamic programming, Math+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Hopscotch 50
Medium4
Dynamic programming, Implementation+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Maximum Subarray 2147483647
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Investment Genius Bae Juhyeong
Medium4
Dynamic programming, Brute force+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Game Addiction
Medium4
Dynamic programming, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Snack Party
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Wiggly Caterpillar Hoseok - Functional
Medium4
Dynamic programming, Array+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Zoo
Medium4
Dynamic programming, Bit manipulation+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
DuTub
Medium4
Bit manipulation, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Gig Combinatorics
Medium4
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Color Robot
Medium4
Dynamic programming, String
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Stepping Stones
Medium4
Dynamic programming, Brute force+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Square Coins
Medium4
Dynamic programming, Math+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Moons and Umbrellas
Medium4
Greedy, Dynamic programming+2
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Balance
Medium4
Dynamic programming, Tree+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Drunk Passenger
Medium4
Probability, Math+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Building Decoration
Medium4
Dynamic programming, Array+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Boris
Medium4
Dynamic programming, Sorting
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Coins
Medium4
Game theory, Math+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Interesting Outing
Medium4
Tree, DFS+1
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Buying Potions
Medium4
Bit manipulation, Dynamic programming
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
1, 3, 5 Segments
Medium4
Dynamic programming, Prefix sum
No attempts yet
Time limit
1.35s
Memory limit
1024 MB
Judgeable
Decisive Friday
Medium4
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Shout the Integers to the End
Medium4
Game theory, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Maximum Sum of Node Values in a Tree
Medium4
Tree, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Flipping Bulb States
Medium4
Array, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Minimum Cost to Color a Tree
Medium4
Tree, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Hang Gliding
Medium4
Dynamic programming, Sorting+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Cookbook Composition
Medium4
Dynamic programming, Topological sort+1
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Improving IT
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Jesting Jabberwocky
Medium4
String, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Backrooms
Medium4
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Palindrome Maker
Medium4
Dynamic programming, Array
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Bags
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Spaces
Medium4
Dynamic programming, String+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Treasure
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Miniröj
Medium4
Dynamic programming, Array
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Dollar Dayz
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Golf
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Stamps
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Building Blocks
Medium4
Sorting, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Equal Summed Subsets
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Garage Sailing
Medium4
Dynamic programming, Sorting
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Subset Sums
Medium4
Dynamic programming, Combinatorics
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Score Inflation
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Meeting
Medium4
Dynamic programming
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Prizes
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Sum of Minimums
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Selfish Parallel Bar Exercise (Easy)
Medium4
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Padovan Sequence 2
Medium4
Matrix, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Everything Is A Nail
Medium4
Dynamic programming, Implementation
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Caravan Trip Plans
Medium4
Dynamic programming, Array
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Clear the Game
Medium4
Dynamic programming, Greedy
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Grid Game
Medium4
Dynamic programming, Game theory
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Magnet
Medium4
Array, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Coins
Medium4
Simulation, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
Cube IV (Small)Given a square grid holding 1 to S squared, find the smallest start of the longest chain that steps to an orthogonal neighbor one higher and report its length.	Medium4	DFSDynamic programming+1	No attempts yet	5s	512 MB	Judgeable
Manage your Energy (Small)Allocate limited energy across ordered activities, regaining R after each up to cap E, to maximize value times energy spent.	Medium4	Dynamic programming	No attempts yet	5s	512 MB	Judgeable
Ocean ViewDestroy as few houses as possible so the heights of the houses left standing grow strictly from the lake eastward.	Medium4	Dynamic programming	No attempts yet	5s	512 MB	Judgeable
Quake Live Team SplitSplit an even number of players with given skill levels into two equal-size teams so the team totals differ as little as possible.	Medium4	Dynamic programmingBrute force	No attempts yet	5s	512 MB	Judgeable
Welcome to Code Jam (Small)Count how many ways the 19-character phrase "welcome to code jam" appears as a subsequence of the input line, and print the last four digits.	Medium4	Dynamic programmingString	No attempts yet	5s	512 MB	Judgeable
Road Network of a Perfect Binary TreeFind the minimum number of cars whose vertex-disjoint paths cover every vertex of a perfect binary tree of height H exactly once.	Medium4	TreeDynamic programming+1	No attempts yet	2s	512 MB	Judgeable
CandySum 2^K over all subsets of N candies with K elements, where the empty subset contributes 0, modulo 1,000,000,007.	Medium4	CombinatoricsMath+2	No attempts yet	2s	512 MB	Judgeable
Partitioning a QueueCount compositions of n whose parts avoid the arithmetic progression m, m+k, m+2k, with n up to 30 and up to 10000 test cases.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	2s	512 MB	Judgeable
CombinationsGiven up to 1000 pairs (n, k), compute the binomial coefficient C(n, k) modulo 10^9+7 for each pair.	Medium4	CombinatoricsMath+2	No attempts yet	2s	512 MB	Judgeable
Lab SchedulePick days to experiment so no two chosen days are within two days of each other, maximizing the sum of visit probabilities.	Medium4	Dynamic programmingGreedy	No attempts yet	2s	512 MB	Judgeable
HamletGiven a DAG of plot states where each action gives a probability distribution over higher-numbered states, find the best expected value from state 1 and round it to two decimals.	Medium4	Dynamic programmingProbability+2	No attempts yet	3s	512 MB	Judgeable
Minimum energy × delay productChoose a frequency level for each of P programs in order to minimize the total energy times delay product, including a fixed cost per frequency change.	Medium4	Dynamic programmingImplementation	No attempts yet	2s	512 MB	Judgeable
Hidden PalindromeGiven a word of at most 40 lowercase letters, find the longest palindromic subsequence obtainable by deleting letters from the front and back.	Medium4	Dynamic programmingString+2	No attempts yet	2s	512 MB	Judgeable
The nearest convenience storeGiven an undirected weighted graph with some vertices marked as homes and others as stores, pick the home whose shortest-path distance to the nearest store is smallest, breaking ties by vertex number.	Medium4	GraphShortest path+2	No attempts yet	2s	512 MB	Judgeable
Box PackingGiven box sizes in order, find the longest subsequence where each box is strictly smaller than the next, counting boxes in the pile.	Medium4	Dynamic programmingBinary search+2	No attempts yet	2s	512 MB	Judgeable
Stretch Rope (Small)N is at most 10, so enumerate subsets of bands and find the cheapest subset whose summed intervals contain L and whose total price is within M.	Medium4	Brute forceArray+2	No attempts yet	5s	512 MB	Judgeable
Safe Squares (Small)Count all axis-aligned D by D subgrids of an R by C grid that contain no monster cell.	Medium4	Dynamic programmingMatrix+2	No attempts yet	5s	512 MB	Judgeable
Resource MiningA robot walks from the top-left to the bottom-right cell of an N by M grid using only right and down moves; find the largest number of resource cells it can pass through.	Medium4	Dynamic programmingMatrix+2	No attempts yet	2s	256 MB	Judgeable
Prerequisite CoursesGiven prerequisite pairs between courses, find the earliest semester each course can be completed when unlimited courses may be taken per semester.	Medium4	GraphTopological sort+2	No attempts yet	5s	256 MB	Judgeable
Image quilting (large)Given two grayscale overlap regions of H rows and W columns, pick one column per row so adjacent rows differ by at most one, minimizing the total squared pixel difference.	Medium4	Dynamic programmingMatrix+1	No attempts yet	1s	512 MB	Judgeable
Pizza (Large)Split a tower of N into unit towers, scoring the product of the two parts at each split, and maximize the total score.	Medium4	GreedyMath+2	No attempts yet	1s	512 MB	Judgeable
Chonggang ChonggangRun a single-source shortest path from Jinseo's house, find the nearest type A and type B house, and report the closer type (A wins ties).	Medium4	Shortest pathGraph+2	No attempts yet	1s	256 MB	Judgeable
Multiples of three from 0, 1, and 2 (Large)Count N-digit numbers made only of the digits 0, 1, and 2 that are divisible by 3, with no leading zero, modulo 1e9+9.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	2s	256 MB	Judgeable
The TA is a sadist!!Given a permutation of 1 to N, find the minimum number of elements to remove so the remaining values increase from front to back.	Medium4	Dynamic programmingBinary search+2	No attempts yet	2s	256 MB	Judgeable
Milk FestivalGiven a sequence of shops selling milk types 0, 1, 2, find the longest subsequence whose values cycle 0,1,2,0,1,2,... in order.	Medium4	Dynamic programming	No attempts yet	1s	256 MB	Judgeable
Frog LeapsFind the minimum sum of squared jump distances to travel from the first stop to the last, given sorted positions.	Medium4	GreedyDynamic programming+1	No attempts yet	2s	512 MB	Judgeable
Irrational DivisionTwo players alternately cut whole columns off the west and rows off the south of a p by q chessboard chocolate; compute the optimal final score difference.	Medium4	Game theoryDynamic programming	No attempts yet	2s	512 MB	Judgeable
Counting pathsCount paths from the top-left to the bottom-right of a grid, moving only right or down and avoiding obstacle cells, modulo 10^9 + 7.	Medium4	Dynamic programmingMatrix	No attempts yet	2s	512 MB	Judgeable
Secret of Chocolate PolesCount sequences of dark and white chocolate disks, each 1 cm thick except dark thick disks at k cm, alternating colors, starting and ending dark, with total thickness at most l.	Medium4	Dynamic programmingCombinatorics	No attempts yet	1s	512 MB	Judgeable
Maximum of A[j]-A[i]+A[l]-A[k]Given an array, choose four increasing indices i<j<k<l maximizing A[j]-A[i]+A[l]-A[k].	Medium4	Dynamic programmingArray+1	No attempts yet	2s	512 MB	Judgeable
1, 2, 3 Sum 3Count the ordered ways to write n as a sum of 1, 2, and 3, with each test case answered modulo 1,000,000,009.	Medium4	Dynamic programmingMath+2	No attempts yet	1s	512 MB	Judgeable
One, Two, Three Plus FourCount the number of unordered sums of 1, 2, and 3 that add up to a given n, for each test case.	Medium4	Dynamic programmingCombinatorics+2	No attempts yet	1s	512 MB	Judgeable
ÜberwatchGiven a sequence of opponent counts over n time slices and a cooldown m, choose firing times at least m slices apart to maximize total opponents defeated.	Medium4	Dynamic programmingArray+2	No attempts yet	2s	512 MB	Judgeable
Coolest Ski RouteGiven a DAG of slopes with condition values, find the maximum total condition along any downhill path.	Medium4	GraphDynamic programming+2	No attempts yet	2s	512 MB	Judgeable
CombinationCompute N choose R modulo 1,000,000,007 for 0 ≤ R ≤ N ≤ 1,000,000 using a prime modulus.	Medium4	MathNumber theory+2	No attempts yet	1s	256 MB	Judgeable
Gun ControlGiven each lawmaker's defeat cost and compromise value, pick a subset whose costs sum to more than B with minimum total compromise.	Medium4	Dynamic programmingArray	No attempts yet	2s	512 MB	Judgeable
Collecting EnergyGiven a row of N weighted beads (N up to 10), remove interior beads one at a time, scoring the product of the neighbors left and right, and maximize the total score.	Medium4	Dynamic programmingRecursion+1	No attempts yet	1s	512 MB	Judgeable
String DiscriminationGiven a target string S and up to 100 words, decide whether S is a concatenation of words from the list, each reusable any number of times.	Medium4	Dynamic programmingString+1	No attempts yet	2s	512 MB	Judgeable
I'm Sick of Fibonacci~Given n, count the total number of calls made by the naive recursive Fibonacci function, modulo 1,000,000,007.	Medium4	Dynamic programmingRecursion+2	No attempts yet	1s	512 MB	Judgeable
Making a PasswordGiven two uppercase strings, find the longest substring that appears in both strings; the answer is unique.	Medium4	StringBrute force+1	No attempts yet	1s	256 MB	Judgeable
My Life Has Math in ItOn an N x N grid (N odd, 3 to 5) holding numbers and operators, find the max and min results of expressions along right/down paths from (1,1) to (N,N), evaluating left to right.	Medium4	Dynamic programmingImplementation+1	No attempts yet	1s	256 MB	Judgeable
Viyott's Stepping Stone CrossingCount the ways to jump from stone 1 to stone N when each jump adds any positive integer, modulo 1e9+7.	Medium4	MathCombinatorics+2	No attempts yet	1s	256 MB	Judgeable
Arranging SoldiersGiven a sequence of N combat powers, find the minimum number of soldiers to remove so the remaining values are in strictly decreasing order.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	256 MB	Judgeable
RUNGiven a directed weighted graph of N cells, one exit cell E, and a time limit T, count how many cells have a path to E within T time units.	Medium4	GraphShortest path+2	No attempts yet	2s	512 MB	Judgeable
Digit SumCount how many starting values between 1 and N can reach N by repeatedly adding the sum of their decimal digits.	Medium4	Dynamic programmingMath+2	No attempts yet	2s	512 MB	Judgeable
Hopscotch 50Given an n by n grid of labels 1 to k, find the minimum total Manhattan distance of a path that visits one tile of each label in order, or -1 if some label is missing.	Medium4	Dynamic programmingImplementation+2	No attempts yet	1s	512 MB	Judgeable
Maximum Subarray 2147483647Given a sequence of n integers, find the maximum possible sum of a contiguous subarray, choosing at least one element.	Medium4	Dynamic programmingArray+2	No attempts yet	2s	512 MB	Judgeable
Investment Genius Bae JuhyeongStarting with H won over Y years, choose among three fixed-term investments (1, 3, or 5 years) to maximize final money, truncating fractions at each payout.	Medium4	Dynamic programmingBrute force+2	No attempts yet	1s	512 MB	Judgeable
Game AddictionCount shortest lattice paths between two diagonal points while staying inside the unflooded region y <= x.	Medium4	Dynamic programmingCombinatorics+2	No attempts yet	1s	1024 MB	Judgeable
Snack PartyGiven N days each with one positive snack rating, pick a strictly increasing subsequence (starting above 0) to maximize the sum of chosen ratings.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	1024 MB	Judgeable
Wiggly Caterpillar Hoseok - FunctionalGiven N food values and a threshold K, choose non-overlapping consecutive segments whose sums each reach K, maximizing the total excess over K.	Medium4	Dynamic programmingArray+2	No attempts yet	1s	512 MB	Judgeable
ZooCount the ways to fill a row of N cages with species from K options so no two adjacent cages share a species or belong to the same quarrel group.	Medium4	Dynamic programmingBit manipulation+2	No attempts yet	1s	1024 MB	Judgeable
DuTubGiven N videos, each with a length and a set of categories among at most 10, choose a subset that covers every category while minimizing total length.	Medium4	Bit manipulationDynamic programming+2	No attempts yet	1s	1024 MB	Judgeable
Gig CombinatoricsCount subsequences of a rating sequence that start with 1, end with 3, and have only 2s in between, modulo 1e9+7.	Medium4	Dynamic programmingCombinatorics+1	No attempts yet	2s	1024 MB	Judgeable
Color RobotChoose N color commands so a robot, which jumps right to the next square of the commanded color, ends as far right as possible.	Medium4	Dynamic programmingString	No attempts yet	1s	1024 MB	Judgeable
Stepping StonesFind the least energy to reach the last stone using small jumps, big jumps, and one optional very big jump that costs K.	Medium4	Dynamic programmingBrute force+2	No attempts yet	1s	1024 MB	Judgeable
Square CoinsCount the number of ways to represent each amount below 300 as a sum of square-valued coins (1, 4, 9, ..., 289), with order ignored.	Medium4	Dynamic programmingMath+2	No attempts yet	2s	512 MB	Judgeable
Moons and UmbrellasFill each ? in a string of C, J, and ? with C or J to minimize the total cost, where each CJ substring costs X and each JC substring costs Y.	Medium4	GreedyDynamic programming+2	No attempts yet	10s	1024 MB	Judgeable
BalanceGiven a vertex budget V, find the maximum possible height of an AVL tree built with at most V vertices.	Medium4	Dynamic programmingTree+2	No attempts yet	1s	1024 MB	Judgeable
Drunk PassengerGiven n passengers where the first sits in a random seat and each displaced passenger picks a random free seat, find the probability that the last passenger's seat is taken.	Medium4	ProbabilityMath+2	No attempts yet	1s	1024 MB	Judgeable
Building DecorationGiven a sequence of building heights, find the length of the longest strictly increasing subsequence.	Medium4	Dynamic programmingArray+1	No attempts yet	1s	1024 MB	Judgeable
BorisGiven trains with departure times, Boris counts, and station coordinates, find the largest total of Boris counts Philip can collect while walking at 1 m/s.	Medium4	Dynamic programmingSorting	No attempts yet	2s	1024 MB	Judgeable
CoinsPlayers alternate removing 1 to 3 coins from a pile of n; whoever takes the last coin loses. Decide whether the first player wins with optimal play.	Medium4	Game theoryMath+2	No attempts yet	1s	1024 MB	Judgeable
Interesting OutingGiven a weighted tree, find the minimum total edge cost of a walk that visits every node, starting and ending at any nodes.	Medium4	TreeDFS+1	No attempts yet	10s	1024 MB	Judgeable
Buying PotionsGiven N potion prices and the discounts each purchase triggers on other potions, find the minimum total cost to buy all of them in some order.	Medium4	Bit manipulationDynamic programming	No attempts yet	3s	1024 MB	Judgeable
1, 3, 5 SegmentsSplit a sequence of N integers into 6 contiguous segments (empty segments allowed) to maximize the sum of segments 1, 3, and 5.	Medium4	Dynamic programmingPrefix sum	No attempts yet	1.35s	1024 MB	Judgeable
Decisive FridayGiven N job durations in days, decide whether some subset of them can be ordered so the work ends exactly on Friday, 4 days after Monday.	Medium4	Dynamic programmingMath	No attempts yet	1s	1024 MB	Judgeable
Shout the Integers to the EndTwo players alternately call integers up to n, each at most k above the last call and never a forbidden value. Output whether the first player wins.	Medium4	Game theoryDynamic programming+1	No attempts yet	1s	512 MB	Judgeable
Maximum Sum of Node Values in a TreeGiven a tree rooted at node 0 with a value on each node, find the maximum sum of values over a connected set of nodes that includes the root.	Medium4	TreeDynamic programming+1	No attempts yet	3s	512 MB	Judgeable
Flipping Bulb StatesGiven bulbs with brightness values and on/off states, flip one contiguous segment once to maximize the total brightness of the bulbs that are on.	Medium4	ArrayDynamic programming	No attempts yet	1s	512 MB	Judgeable
Minimum Cost to Color a TreePaint each vertex of a tree white or black so that no two adjacent vertices are both black, at the minimum total cost.	Medium4	TreeDynamic programming+1	No attempts yet	3s	512 MB	Judgeable
Hang GlidingGiven overlapping timed tasks with point values and each pilot's success probabilities, find each pilot's best expected score and print the top 3 pilots.	Medium4	Dynamic programmingSorting+2	No attempts yet	1s	1024 MB	Judgeable
Cookbook CompositionGiven each recipe as a dependency graph of timed steps, sort the recipes by the ratio of serial time to parallel critical-path time.	Medium4	Dynamic programmingTopological sort+1	No attempts yet	2s	2048 MB	Judgeable
Improving ITFind the minimum net cost of keeping one CPU over n months, buying and reselling it so that each CPU is replaced within m months.	Medium4	Dynamic programmingImplementation	No attempts yet	2s	1024 MB	Judgeable
Jesting JabberwockyGiven a string of card suits, find the fewest cards to move so that every suit ends up grouped together.	Medium4	StringDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
BackroomsFind the maximum sum of room numbers on a path from the top left to the bottom right of an N by M grid, moving only down or right past one straight wall.	Medium4	Dynamic programmingMatrix	No attempts yet	1s	1024 MB	Judgeable
Palindrome MakerFind the fewest integers to insert into a sequence so that it reads the same forwards and backwards.	Medium4	Dynamic programmingArray	No attempts yet	3s	1024 MB	Judgeable
BagsFor each data set, find the fewest items whose weights sum exactly to the target, or report Not possible if no such subset exists.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
SpacesGiven a dictionary and a string with its spaces removed, output the zero-based indices where spaces belong so the string splits into dictionary words.	Medium4	Dynamic programmingString+1	No attempts yet	1s	1024 MB	Judgeable
TreasureGiven items with values and weights and a capacity, the task finds the maximum total value of items that fit in one trip, for several data sets.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
MiniröjGiven the bottom row of a 2xN Minesweeper board with its clue numbers, label each top cell as safe, certain mine, or undetermined.	Medium4	Dynamic programmingArray	No attempts yet	3s	1024 MB	Judgeable
Dollar DayzCount the ways to spend exactly N dollars on unlimited tools priced $1 to $K, where the order of purchases does not matter.	Medium4	Dynamic programming	No attempts yet	1s	1024 MB	Judgeable
GolfGiven a distance D and C club distances, find the fewest strokes that sum to exactly D, or 0 if impossible.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
StampsGiven stamp values and a limit on how many stamps fit on an envelope, find the longest run of consecutive postage values that can be made.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Building BlocksGiven blocks that may be rotated, find the height of the tallest tower where each block fits within the width and length of the block below.	Medium4	SortingDynamic programming	No attempts yet	1s	1024 MB	Judgeable
Equal Summed SubsetsCount the ways to split {1, ..., N} into two disjoint subsets with equal sums, counting a swapped pair once.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Garage SailingPick at most K of N objects to maximize the total gap between market value and garage sale price, and print that maximum profit.	Medium4	Dynamic programmingSorting	No attempts yet	1s	1024 MB	Judgeable
Subset SumsCount the ways to split the integers 1 to N into two subsets with equal sums, where swapping the two subsets gives the same partition.	Medium4	Dynamic programmingCombinatorics	No attempts yet	1s	1024 MB	Judgeable
Score InflationGiven a contest length of M minutes and N problem categories with points and solve times, find the maximum total points using unlimited problems from each category within M minutes.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
MeetingGiven the personalities of students from two universities, find non-crossing handshake pairs that maximize the total satisfaction W[a][b].	Medium4	Dynamic programming	No attempts yet	1s	512 MB	Judgeable
PrizesGiven prize values in order, find the maximum sum of a subsequence whose values are strictly increasing.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Sum of MinimumsSplit an array of n numbers into k contiguous parts so the sum of each part's minimum is as large as possible, and output the split points.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Selfish Parallel Bar Exercise (Easy)Split N trainees into M contiguous groups to maximize the sum, over all groups, of the strengths of each group's tallest members.	Medium4	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Padovan Sequence 2Given N up to 10^18, compute P(N) modulo 998244353, where each term is the sum of the terms two and three positions before it.	Medium4	MatrixDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Everything Is A NailGiven a sequence of nail, screw, and bolt tasks, find the most tasks you can complete when switching tools permanently loses the old one.	Medium4	Dynamic programmingImplementation	No attempts yet	5s	1024 MB	Judgeable
Caravan Trip PlansCount the distinct day-by-day camp sequences that start at camp 0, never move backward, and reach a given oasis on a given day.	Medium4	Dynamic programmingArray	No attempts yet	5s	1024 MB	Judgeable
Clear the GamePick one weapon per run so that consecutive runs never share a weapon, minimizing the total clear time over N runs.	Medium4	Dynamic programmingGreedy	No attempts yet	1s	512 MB	Judgeable
Grid GameFor each start cell on a grid with blocked cells, decide the winner of a game that moves a piece to the bottom-right corner with down, right, or diagonal moves of up to K cells.	Medium4	Dynamic programmingGame theory	No attempts yet	1s	1024 MB	Judgeable
MagnetPick two different cells for the N and S poles to maximize a_i minus a_j minus K times the distance between them.	Medium4	ArrayDynamic programming	No attempts yet	2s	1024 MB	Judgeable
CoinsCount the moves until no coins are heads up, where each move flips coin k and k is the current heads count, or print -1 if the game never ends.	Medium4	SimulationDynamic programming	No attempts yet	1s	1024 MB	Judgeable