Interview core

Mediums from real onsites

Under construction

Still being built. Things may change

Total results3,617 problems

Cow Laundry
Medium5
Array, Sorting
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Millenium Leapcow
Medium5
Dynamic programming, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Lost Cows
Medium5
Segment tree, Binary search+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Cowties
Medium5
Dynamic programming, Geometry
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Restoring the Data Order
Medium5
Array, Brute force+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Escape from the Ancient Legendary Mine
Medium5
Dynamic programming, Math
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Secret Milk Pipes
Medium5
Minimum spanning tree, Graph+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Superwords
Medium5
Greedy, String matching+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Ski Cows
Medium5
Dynamic programming, Graph+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Stop Overtime!
Medium5
Greedy, Binary search+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Big Barn
Medium5
Dynamic programming, Matrix+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Cow Tours
Medium5
Shortest path, Graph+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Different Dice
Medium5
Dynamic programming, Math
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Herd Splitting
Medium5
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
COPS: Cows On Pogo Sticks
Medium5
BFS, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Duels in an Age of Falling Cherry Blossoms
Medium5
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Campfire Riddle
Medium5
Math, Greedy
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Pick a Pair
Medium5
String, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Tournament
Medium5
Sorting, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
One-dimensional Game
Medium5
Sorting, Tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Binary Ones
Medium5
Bit manipulation, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Beautiful Permutations
Medium5
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Reforms in the Kingdom
Medium5
Dynamic programming, Binary search
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Robot
Medium5
Greedy, Union-find+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
L-Board
Medium5
Dynamic programming, Matrix
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Dongwoo, is his heart kind or cruel?
Medium5
Tree, DFS+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Efficient Anime Watching
Medium5
Dynamic programming, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Fluffy Fox Tail
Medium5
Sliding window, Array+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
JOI Four Students (JOI04)
Medium5
Sorting, Sliding window+2
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Paint Fill
Medium5
Graph, BFS+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Dirigent
Medium5
Array, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Rabbit Carrot
Medium5
Dynamic programming, Binary search+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Cards
Medium5
Hash map, Combinatorics
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Coins
Medium5
Dynamic programming, Matrix+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Dungeon
Medium5
Greedy, Math
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Solar Charging
Medium5
Dynamic programming, Implementation
No attempts yet
Time limit
0.5s
Memory limit
512 MB
Judgeable
Particle Experiment
Medium5
Dynamic programming, Bit manipulation
No attempts yet
Time limit
1.5s
Memory limit
512 MB
Judgeable
Cutting Wooden Sticks
Medium5
Dynamic programming, Array
No attempts yet
Time limit
0.5s
Memory limit
512 MB
Judgeable
Counting Special Integer Pairs
Medium5
Binary search, Sorting+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Stop Leaving Me on Read!
Medium5
Dynamic programming, Recursion
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Oh no, XOR again?
Medium5
Dynamic programming, Bit manipulation
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Platform Placing
Medium5
Greedy, Sorting
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
String Conversion and Queries
Medium5
String, Implementation
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Amazing Images
Medium5
Dynamic programming, Prefix sum+1
No attempts yet
Time limit
0.6s
Memory limit
1024 MB
Judgeable
Password
Medium5
Greedy, String
No attempts yet
Time limit
1.6s
Memory limit
1024 MB
Judgeable
Lazy
Medium5
Minimum spanning tree, Union-find+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Make 1 (Part 3)
Medium5
Dynamic programming, Recursion+1
No attempts yet
Time limit
0.5s
Memory limit
1024 MB
Judgeable
Movie Director Shom 3
Medium5
Dynamic programming, Combinatorics
No attempts yet
Time limit
0.5s
Memory limit
1024 MB
Judgeable
Good Night in the Lab
Medium5
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Is the Order Pottery?
Medium5
Greedy, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Parenthesis Sequence Character
Medium5
Recursion, Math+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Adjacent Pairs
Medium5
Hash map, Array+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Nice Subset
Medium5
Number theory, Probability+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Suffix Operations
Medium5
Array, Prefix sum+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
White Lines
Medium5
Prefix sum, Matrix+1
No attempts yet
Time limit
1.5s
Memory limit
256 MB
Judgeable
Compress Words
Medium5
String, String matching
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Relative Pitch Song Search
Medium5
String matching, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Function Sequence and Queries
Medium5
Segment tree, Array+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Bead Sort
Medium5
Sorting, Math
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Hanging a Banner
Medium5
Hash map, Two pointers+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Cheese
Medium5
Graph, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Canal
Medium5
Union-find, Graph+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Alchemy
Medium5
String, Greedy
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Chocolate Chip Fabrication
Medium5
BFS, Matrix
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Family Visits
Medium5
Greedy, Heap
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Repetitive Song
Medium5
Hash map, Implementation+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Wooden Fence
Medium5
Dynamic programming, Math+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Inchworm Cut
Medium5
Prefix sum, Two pointers+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
AB
Medium5
Hash map, String+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Exam
Medium5
Binary search, Sorting+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Ferries (Easy)
Medium5
BFS, Graph+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Turning gears (hard)
Medium5
Graph, BFS+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
A+B
Medium5
Greedy, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Cells
Medium5
String, Hash map+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Dragon Slayer
Medium5
BFS, Graph+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Amazing Mobistudy
Medium5
Union-find, Hash map
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Cowherd and Weaver Girl
Medium5
Tree, DFS+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Sequence Rearrangement
Medium5
Array, Sorting+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
World Cup Group Stage
Medium5
Binary search, Implementation+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Saving the universe again
Medium5
String, Greedy+1
No attempts yet
Time limit
20s
Memory limit
1024 MB
Judgeable
Waffle Choppers
Medium5
Prefix sum, Math+1
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
Bit Party
Medium5
Binary search, Sorting+1
No attempts yet
Time limit
15s
Memory limit
1024 MB
Judgeable
Rounding Error
Medium5
Greedy, Math
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Ant Stack
Medium5
Dynamic programming, Greedy
No attempts yet
Time limit
15s
Memory limit
1024 MB
Judgeable
Alien Rhyme
Medium5
Trie, Greedy+1
No attempts yet
Time limit
20s
Memory limit
1024 MB
Judgeable
Pattern Matching
Medium5
String, String matching+1
No attempts yet
Time limit
20s
Memory limit
1024 MB
Judgeable
Cow-libi
Medium5
Sorting, Binary search+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Watching Mooloo
Medium5
Dynamic programming, Intervals+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Sum of Remainders
Medium5
Number theory, Math+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Gahee and Seoul Subway Line 3
Medium5
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Gahui and the Subway Station Storage System 1
Medium5
Bit manipulation, Hash map+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Special student ID
Medium5
Dynamic programming, Matrix
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Special Serving
Medium5
Greedy, Heap
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Special Fire Alarm
Medium5
Greedy, Array
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
2D Paper Play
Medium5
Sorting, Prefix sum+1
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Apartment Complexes
Medium5
Binary search, Dynamic programming+1
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Induction
Medium5
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Gojeonyeon Train Play
Medium5
Dynamic programming, Sliding window+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Dinosaur Game
Medium5
Dynamic programming, Implementation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
The More Cats, the Better
Medium5
Dynamic programming, Recursion+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
Cow LaundryGiven the wire orders on the top and bottom holders, find the fewest adjacent swaps that leave no wires crossing.	Medium5	ArraySorting	No attempts yet	1s	1024 MB	Judgeable
Millenium LeapcowFind the longest chain of knight moves that only go to higher numbers on an N by N board, and print the lexicographically smallest such path.	Medium5	Dynamic programmingSorting+1	No attempts yet	1s	1024 MB	Judgeable
Lost CowsGiven, for each cow, how many cows ahead of it have smaller brands, the task is to recover the order in which the N cows stand in line.	Medium5	Segment treeBinary search+1	No attempts yet	1s	1024 MB	Judgeable
CowtiesPick one preferred spot per cow so that the closed loop of rope through all cows has the minimum total Euclidean length.	Medium5	Dynamic programmingGeometry	No attempts yet	1s	1024 MB	Judgeable
Restoring the Data OrderGiven three copies of a permutation, each with one stage moved earlier, restore the original order of stages 1 to N.	Medium5	ArrayBrute force+1	No attempts yet	1s	1024 MB	Judgeable
Escape from the Ancient Legendary MinePick a subset of ore carts to maximize total ore value while the momentum-based escape time from distance X to the entrance stays within T.	Medium5	Dynamic programmingMath	No attempts yet	3s	1024 MB	Judgeable
Secret Milk PipesGiven W water stations and P weighted bidirectional pipes, find the total cost of the second cheapest spanning tree of the network.	Medium5	Minimum spanning treeGraph+1	No attempts yet	1s	1024 MB	Judgeable
SuperwordsGiven N words, find the shortest superword that contains each word as a subword in the given order, with start and end letters strictly increasing.	Medium5	GreedyString matching+1	No attempts yet	1s	1024 MB	Judgeable
Ski CowsCount the downhill ski routes from the highest landmark to the lowest, where each ski path between two landmarks counts as a separate option.	Medium5	Dynamic programmingGraph+1	No attempts yet	1s	1024 MB	Judgeable
Stop Overtime!Given N tasks with deadlines and required workdays, find the fewest overtime days needed to finish every task on time, or -1 if that is impossible.	Medium5	GreedyBinary search+1	No attempts yet	1s	1024 MB	Judgeable
Big BarnFind the largest axis-aligned square of tree-free parcels in an N by N grid with up to 500 tree parcels given as coordinates.	Medium5	Dynamic programmingMatrix+1	No attempts yet	1s	1024 MB	Judgeable
Cow ToursGiven pasture coordinates and cow paths, add one path between two unconnected pastures to minimize the diameter of the joined graph and print that diameter.	Medium5	Shortest pathGraph+2	No attempts yet	1s	1024 MB	Judgeable
Different DiceGiven two sets of dice, decide whether they produce the same possible sums and the same sum probabilities, then report how many distinct sums each set can yield.	Medium5	Dynamic programmingMath	No attempts yet	1s	1024 MB	Judgeable
Herd SplittingEach cow goes to herd A, herd B, or is removed so both herds give equal milk. Find the largest possible common total.	Medium5	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
COPS: Cows On Pogo SticksFind the fewest jumps for a pogo stick to go from 0 to L, where velocity changes by at most 1 per jump and cow pie points cannot be landed on.	Medium5	BFSDynamic programming	No attempts yet	1s	1024 MB	Judgeable
Duels in an Age of Falling Cherry BlossomsGiven attacks with aura and life damage options, choose for each attack whether to take aura or life damage so the player with A aura and L life survives.	Medium5	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
Campfire RiddleSplit n people into groups of distinct sizes, where each group is a clique of friends, and find the minimum total number of friend pairs.	Medium5	MathGreedy	No attempts yet	1s	1024 MB	Judgeable
Pick a PairGiven n equal-length words, find the largest k such that the words can be paired so that each pair shares a common prefix of length at least k.	Medium5	StringSorting+1	No attempts yet	1s	1024 MB	Judgeable
TournamentRemove one student as host and pair the other n-1 students so that the gap between the largest and smallest pair sums is as small as possible.	Medium5	SortingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
One-dimensional GameGiven n distinct segments, count for each segment the downward move paths in its containment tree, modulo 1e9+7.	Medium5	SortingTree+1	No attempts yet	2s	1024 MB	Judgeable
Binary OnesGiven x and k, find the smallest y of at least 0 such that x + y has exactly k ones in its binary form.	Medium5	Bit manipulationGreedy+1	No attempts yet	1s	1024 MB	Judgeable
Beautiful PermutationsGiven n and k, count the permutations of 1 to n whose sum of adjacent products is divisible by k.	Medium5	Dynamic programmingBit manipulation+1	No attempts yet	1s	1024 MB	Judgeable
Reforms in the KingdomSplit n sorted city positions into k consecutive provinces of a to b cities each, minimizing the largest distance between two cities in one province.	Medium5	Dynamic programmingBinary search	No attempts yet	1s	1024 MB	Judgeable
RobotGiven jobs with deadlines and late penalties, schedule one job per day to minimize the total penalty of late jobs, and print each job's day.	Medium5	GreedyUnion-find+1	No attempts yet	1s	1024 MB	Judgeable
L-BoardPick a cell as the corner of an L and maximise the vertical and horizontal segment sums through it, counting the corner once.	Medium5	Dynamic programmingMatrix	No attempts yet	2s	1024 MB	Judgeable
Dongwoo, is his heart kind or cruel?Given a weighted tree of N villages with signed edge costs, find the minimum and maximum total path cost from one house point (on a village or along a road) to all villages.	Medium5	TreeDFS+1	No attempts yet	2s	1024 MB	Judgeable
Efficient Anime WatchingFind the most episodes watchable within M hours, where episodes play in groups of at most K and each group lasts as long as its longest episode.	Medium5	Dynamic programmingSorting+1	No attempts yet	1s	1024 MB	Judgeable
Fluffy Fox TailGiven fluffy periods and at most K casts that each last T hours, find the longest continuous fluffy stretch between hours 0 and M.	Medium5	Sliding windowArray+1	No attempts yet	1s	1024 MB	Judgeable
JOI Four Students (JOI04)Pick one height from each of four lists of N values so that the gap between the tallest and shortest chosen height is as small as possible.	Medium5	SortingSliding window+2	No attempts yet	3s	1024 MB	Judgeable
Paint FillGiven an H by W color grid, find the largest region size you can get by recoloring one connected region once with any color.	Medium5	GraphBFS+1	No attempts yet	2s	1024 MB	Judgeable
DirigentAfter each swap in a circle of n students, decide whether cutting one neighbouring pair leaves the labels in sorted order.	Medium5	ArrayImplementation	No attempts yet	1s	1024 MB	Judgeable
Rabbit CarrotFind the fewest poles whose heights must change so a rabbit starting at height 0 can cross, rising at most M per jump and falling freely.	Medium5	Dynamic programmingBinary search+1	No attempts yet	1s	1024 MB	Judgeable
CardsCount the unordered pairs of 2x2 letter cards that can be placed side by side or stacked with matching edges, without rotating or flipping.	Medium5	Hash mapCombinatorics	No attempts yet	1s	1024 MB	Judgeable
CoinsRearrange an N x N grid of copper and silver coins so all copper sits in a staircase region at the top left, using the fewest swaps.	Medium5	Dynamic programmingMatrix+1	No attempts yet	2s	1024 MB	Judgeable
DungeonGiven monster damage and scroll effects for each room, find the minimum starting health that lets the hero defeat every monster in order.	Medium5	GreedyMath	No attempts yet	1s	512 MB	Judgeable
Solar ChargingEach day the battery is either charged by sunlight or used, and the task is to find the minimum electricity cost while ending at or above the starting charge.	Medium5	Dynamic programmingImplementation	No attempts yet	0.5s	512 MB	Judgeable
Particle ExperimentCount the ways to place 1x2 switches on an R by C grid so every particle reaches the sensor positive, modulo 1e9+7.	Medium5	Dynamic programmingBit manipulation	No attempts yet	1.5s	512 MB	Judgeable
Cutting Wooden SticksGiven sticks of various lengths and a cutting cost a(L-1)^2+b per stick, find the minimum total cost to obtain at least K unit-length sticks.	Medium5	Dynamic programmingArray	No attempts yet	0.5s	512 MB	Judgeable
Counting Special Integer PairsGiven arrays A and B, find the smallest D where the number of pairs with Z(i, j) at most D equals K, or report -1 if none exists.	Medium5	Binary searchSorting+1	No attempts yet	1s	512 MB	Judgeable
Stop Leaving Me on Read!Given n, s, and t, find the minimum time to write the message n times by typing it or doubling the copies with copy and paste.	Medium5	Dynamic programmingRecursion	No attempts yet	1s	512 MB	Judgeable
Oh no, XOR again?Count the integers x from A to B inclusive where x XOR N has exactly K ones in its binary form.	Medium5	Dynamic programmingBit manipulation	No attempts yet	1s	512 MB	Judgeable
Platform PlacingPlace one platform of length s to k under each foundation point so that neighboring platforms never overlap, maximizing the total length.	Medium5	GreedySorting	No attempts yet	1.5s	1024 MB	Judgeable
String Conversion and QueriesApply character replacement queries to a string in order and print the current string for each print query.	Medium5	StringImplementation	No attempts yet	3s	512 MB	Judgeable
Amazing ImagesCount the colorings of an M by N pixel grid where every K consecutive columns include a column with at least F black pixels, modulo 1,000,000,007.	Medium5	Dynamic programmingPrefix sum+1	No attempts yet	0.6s	1024 MB	Judgeable
PasswordGiven strings A and B, find the lexicographically smallest anagram of B that is a subsequence of A, or report impossible if none exists.	Medium5	GreedyString	No attempts yet	1.6s	1024 MB	Judgeable
LazyPick N-1 roads that connect all N cities, minimizing the total C1 first, then maximizing the sum of C1 times C2 among ties.	Medium5	Minimum spanning treeUnion-find+2	No attempts yet	1s	1024 MB	Judgeable
Make 1 (Part 3)Given N up to 10^18, find the minimum number of operations (divide by 3, divide by 2, or subtract 1) to reduce N to 1.	Medium5	Dynamic programmingRecursion+1	No attempts yet	0.5s	1024 MB	Judgeable
Movie Director Shom 3Given N, print the Nth smallest number that contains at least three 6s in a row, with N up to 10^18.	Medium5	Dynamic programmingCombinatorics	No attempts yet	0.5s	1024 MB	Judgeable
Good Night in the LabGiven N pages and M scattered papers, find the minimum ink to print every missing page, where printing K consecutive pages costs 5+2K.	Medium5	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
Is the Order Pottery?Given customer arrival times, decide whether one worker can make, fill, and serve a pot for each customer on time before its coffee turns muddy.	Medium5	GreedySorting+1	No attempts yet	1s	1024 MB	Judgeable
Parenthesis Sequence CharacterGiven n and k, find the k-th character of the bracket string S_n = (S_{n-2} S_{n-1}), or print 0 if k exceeds its length.	Medium5	RecursionMath+1	No attempts yet	1s	1024 MB	Judgeable
Adjacent PairsGiven a good array (no equal adjacent elements), find the fewest element changes so that exactly two distinct values remain and the array stays good.	Medium5	Hash mapArray+1	No attempts yet	3s	1024 MB	Judgeable
Nice SubsetGiven N integers from 2 to 1e9, pick ceil(N/2) of them that share a common divisor greater than 1, or report that no such subset exists.	Medium5	Number theoryProbability+1	No attempts yet	1s	1024 MB	Judgeable
Suffix OperationsGiven an array, find the fewest suffix increment or decrement operations needed to make all elements equal, after optionally changing one element to any value.	Medium5	ArrayPrefix sum+1	No attempts yet	1s	512 MB	Judgeable
White LinesGiven an n by n grid of black and white cells, paint one k by k square white to maximize the number of fully white rows and columns.	Medium5	Prefix sumMatrix+1	No attempts yet	1.5s	256 MB	Judgeable
Compress WordsMerge the words left to right, removing the longest prefix of each new word that matches a suffix of the result, then print the final word.	Medium5	StringString matching	No attempts yet	1s	256 MB	Judgeable
Relative Pitch Song SearchGiven N songs of note values and a melody, list the indices of songs that contain the melody at any constant pitch offset, or print -1.	Medium5	String matchingArray	No attempts yet	1s	1024 MB	Judgeable
Function Sequence and QueriesGiven n permutations of 1 to 5, each query updates one permutation so the composition over a range matches a target, then prints the new permutation.	Medium5	Segment treeArray+1	No attempts yet	2s	1024 MB	Judgeable
Bead SortGiven n positive integers, find the total number of cells all beads fall in bead sort, modulo 1000000007.	Medium5	SortingMath	No attempts yet	2s	1024 MB	Judgeable
Hanging a BannerGiven N values, determine whether some window of M consecutive values contains at least ceil(0.9M) copies of one value.	Medium5	Hash mapTwo pointers+1	No attempts yet	1s	1024 MB	Judgeable
CheeseEach shop sells a bundle of two cheeses for a set price. Find the cheapest set of bundles that covers all N cheese kinds at least once.	Medium5	GraphDynamic programming	No attempts yet	1s	1024 MB	Judgeable
CanalChoose one vertical cut between two adjacent columns to minimize the total number of same-elevation connected regions on both sides.	Medium5	Union-findGraph+1	No attempts yet	2s	1024 MB	Judgeable
AlchemyFind the fewest operations, each changing two adjacent letters to new values, that turn a lowercase string of length up to 100 into a palindrome.	Medium5	StringGreedy	No attempts yet	1s	1024 MB	Judgeable
Chocolate Chip FabricationGiven a grid cookie shape, find the minimum number of chocolate chip exposures needed to chipify every cookie square.	Medium5	BFSMatrix	No attempts yet	1s	1024 MB	Judgeable
Family VisitsGiven daily mess and cleaning capacities and the visit days, find the fewest afternoons of cleaning so the room is clean at every visit, or -1 if impossible.	Medium5	GreedyHeap	No attempts yet	2s	1024 MB	Judgeable
Repetitive SongGiven n words, find the longest word subsequence that can be matched by two different index tuples, or print 0 if none exists.	Medium5	Hash mapImplementation+1	No attempts yet	1s	1024 MB	Judgeable
Wooden FenceDecide whether N boards of given lengths, each used exactly once, can tile a rectangular fence of height 2 without overlap.	Medium5	Dynamic programmingMath+1	No attempts yet	2s	1024 MB	Judgeable
Inchworm CutCount the ways to split an array into head, chest, and abdomen segments whose sums satisfy head < abdomen < chest.	Medium5	Prefix sumTwo pointers+1	No attempts yet	1s	1024 MB	Judgeable
ABMaintain string sets A and B with add and delete, and count ways to write a query string as a prefix of an A element joined with a suffix of a B element.	Medium5	Hash mapString+1	No attempts yet	2s	1024 MB	Judgeable
ExamChoose K of N exams, where exam i has P_i correct answers out of Q_i questions, to maximize the sum of P divided by the sum of Q.	Medium5	Binary searchSorting+1	No attempts yet	2s	1024 MB	Judgeable
Ferries (Easy)Given 2n cars and the positions your car must hold in order, find the fewest L/R ferry crossings that produce them and output one such string.	Medium5	BFSGraph+1	No attempts yet	1s	1024 MB	Judgeable
Turning gears (hard)Given circles whose touching pairs form a tree, find the speed and direction of gear n when gear 1 turns clockwise at 1 revolution per second.	Medium5	GraphBFS+1	No attempts yet	2s	1024 MB	Judgeable
A+BRearrange the given digits into two numbers without leading zeros so that their sum is as large as possible, and print that sum.	Medium5	GreedySorting+1	No attempts yet	1s	1024 MB	Judgeable
CellsGiven formulas with cell references and the operators + - * /, compute every cell's value and print them sorted by cell name.	Medium5	StringHash map+1	No attempts yet	1s	1024 MB	Judgeable
Dragon SlayerGiven a dragon with N heads and two swords (c, g), decide whether the prince can kill it and survive, can only kill it while dying (DRAW), or cannot kill it.	Medium5	BFSGraph+1	No attempts yet	1s	1024 MB	Judgeable
Amazing MobistudyGiven agreement graphs from three studies on N employees, find every group of two or more employees who share the same connected component in all three.	Medium5	Union-findHash map	No attempts yet	1s	256 MB	Judgeable
Cowherd and Weaver GirlGiven two weighted trees, pick one vertex from each and join them with a unit edge to minimize the sum of distances over all cross pairs.	Medium5	TreeDFS+1	No attempts yet	1s	1024 MB	Judgeable
Sequence RearrangementGiven a permutation of 1 to N, rearrange one window of K consecutive elements so the longest contiguous increasing run is as long as possible, then print its length.	Medium5	ArraySorting+1	No attempts yet	2s	512 MB	Judgeable
World Cup Group StageGiven a group table with one missing score for team T, find the smallest goal count that lets T finish in the top two, or -1 if none exists up to K.	Medium5	Binary searchImplementation+1	No attempts yet	2s	512 MB	Judgeable
Saving the universe againGiven a C/S program and a damage limit D, find the fewest adjacent instruction swaps that bring total shot damage to D or less.	Medium5	StringGreedy+1	No attempts yet	20s	1024 MB	Judgeable
Waffle ChoppersGiven a grid of chocolate chips, decide whether H horizontal and V vertical cuts can split it into (H+1)(V+1) pieces with equal chip counts.	Medium5	Prefix sumMath+1	No attempts yet	6s	1024 MB	Judgeable
Bit PartyGiven robots and cashiers with capacity, scan time, and fixed fee, find the earliest time all robots can finish after splitting the bits among them.	Medium5	Binary searchSorting+1	No attempts yet	15s	1024 MB	Judgeable
Rounding ErrorGiven vote counts so far in a survey of N people, find the largest possible sum of rounded percentages after the remaining people respond.	Medium5	GreedyMath	No attempts yet	10s	1024 MB	Judgeable
Ant StackGiven ants listed by increasing length with their weights, find the largest stack where each ant carries at most 6 times its own weight above it.	Medium5	Dynamic programmingGreedy	No attempts yet	15s	1024 MB	Judgeable
Alien RhymeEach word gets one accented suffix, and the task is to find the most words that can form pairs sharing equal suffixes, with no suffix reused across pairs.	Medium5	TrieGreedy+1	No attempts yet	20s	1024 MB	Judgeable
Pattern MatchingGiven N wildcard patterns where * matches any string, find one name of at most 10^4 letters that matches all of them, or print * if none exists.	Medium5	StringString matching+1	No attempts yet	20s	1024 MB	Judgeable
Cow-libiGiven grazing spots with times and cow alibis with locations and times, count the alibis that make it impossible for the cow to reach every grazing at speed 1.	Medium5	SortingBinary search+1	No attempts yet	4s	1024 MB	Judgeable
Watching MoolooGiven N watch days, find the minimum total cost of subscriptions where a subscription of length d costs d plus K and must cover every watch day.	Medium5	Dynamic programmingIntervals+1	No attempts yet	1s	1024 MB	Judgeable
Sum of RemaindersGiven S_K(1) to S_K(N) for an unknown multiset K of integers at least 2, recover K from these sums of remainders.	Medium5	Number theoryMath+1	No attempts yet	2s	1024 MB	Judgeable
Gahee and Seoul Subway Line 3Count the ways to assign each of n stations a ground floor (5 choices) or underground floor (11 choices) so the longest alternating run has length m, modulo 1e9+7.	Medium5	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
Gahui and the Subway Station Storage System 1Given stations and a stream of feature updates, count the stations that have all the features named in each query.	Medium5	Bit manipulationHash map+1	No attempts yet	2s	512 MB	Judgeable
Special student IDCount the paths from (0, 0) to (N-1, M-1) on a grid where runs move right or down and at most one portal teleport is allowed, modulo 10^9+7.	Medium5	Dynamic programmingMatrix	No attempts yet	1s	1024 MB	Judgeable
Special ServingGiven N values x_i, find the fewest students to switch from pamuntwi to eggplant so the running sum never reaches M.	Medium5	GreedyHeap	No attempts yet	1s	512 MB	Judgeable
Special Fire AlarmGiven a permutation and at most L adjacent swaps, find the maximum number of inversions that can be reached.	Medium5	GreedyArray	No attempts yet	1s	512 MB	Judgeable
2D Paper PlayFor each block, count the sheets with w at least x and h at least y, then answer each query by counting blocks whose count falls in [L, U].	Medium5	SortingPrefix sum+1	No attempts yet	3s	512 MB	Judgeable
Apartment ComplexesSplit sorted apartment positions into consecutive groups of at least M, each spanning at most X, and answer each query X.	Medium5	Binary searchDynamic programming+1	No attempts yet	1.5s	1024 MB	Judgeable
InductionGiven N dish temperatures (0 to 9) in order, find the fewest button presses on three cyclic zones so each dish has a matching zone.	Medium5	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Gojeonyeon Train PlaySplit a string of K and Y into the fewest consecutive segments, each at most L long, where the K and Y counts differ by at most 1.	Medium5	Dynamic programmingSliding window+2	No attempts yet	1s	1024 MB	Judgeable
Dinosaur GameGiven obstacles that need a jump, a slide, or either, find the minimum penalty under separate jump and slide cooldowns, or -1 if no valid sequence exists.	Medium5	Dynamic programmingImplementation	No attempts yet	1s	1024 MB	Judgeable
The More Cats, the BetterGiven N, find the fewest creation or cloning spells that leave exactly N cats, where a cloning spell adds up to the current cat count.	Medium5	Dynamic programmingRecursion+1	No attempts yet	1s	1024 MB	Judgeable