Interview core

Mediums from real onsites

Under construction

Still being built. Things may change

Total results3,613 problems

Spectating Villages
Medium7
Dynamic programming, Tree+2
No attempts yet
Time limit
20s
Memory limit
1024 MB
Judgeable
The 4M Corporation
Medium7
Math, Greedy+2
No attempts yet
Time limit
20s
Memory limit
1024 MB
Judgeable
Dance Battle
Medium7
Greedy, Heap+1
No attempts yet
Time limit
20s
Memory limit
1024 MB
Judgeable
Booklet Distribution
Medium7
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Lacquer Chopsticks (Chopsticks)
Medium7
Dynamic programming, Intervals+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Committee
Medium7
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Short Vowels
Medium7
Dynamic programming, String+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Eagle Attack
Medium7
Tree, DFS+2
No attempts yet
Time limit
7s
Memory limit
1024 MB
Judgeable
Fishing
Medium7
Geometry, Sorting+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
100 meter dash
Medium7
Two pointers, Geometry+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Circuit Resistance
Medium7
Tree, DFS+2
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Good Influencers
Medium7
Tree, DFS+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Redistributing Gifts
Medium7
Graph, Greedy+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
Spectating VillagesOn a tree of villages with beauty values, choose lighthouse vertices so the sum of beauties of chosen and adjacent vertices is maximized.	Medium7	Dynamic programmingTree+2	No attempts yet	20s	1024 MB	Judgeable
The 4M CorporationFind the minimum number of positive integers with given minimum, maximum, mean, and median, or report impossibility.	Medium7	MathGreedy+2	No attempts yet	20s	1024 MB	Judgeable
Dance BattleEach rival can be danced (costs energy, gains honor), recruited (gains energy, loses honor), delayed to the back, or skipped; maximize final honor.	Medium7	GreedyHeap+1	No attempts yet	20s	1024 MB	Judgeable
Booklet DistributionGiven a rooted tree and m booklets, choose a connected subtree containing the root that maximizes the sum of node values, where each node needs one booklet and passes the rest to children.	Medium7	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Lacquer Chopsticks (Chopsticks)Given a target color string of length N, find the minimum number of range-paint operations (each painting a contiguous interval one color) needed to produce it.	Medium7	Dynamic programmingIntervals+2	No attempts yet	1s	1024 MB	Judgeable
CommitteeGiven a rooted tree with one node per person and a value per node, pick a nonempty connected subtree maximizing the sum of its node values.	Medium7	TreeDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Short VowelsCount the subsequences of a word (not the whole word, not empty) that contain no short vowel, meaning no vowel followed by two or more consonants.	Medium7	Dynamic programmingString+2	No attempts yet	1s	1024 MB	Judgeable
Eagle AttackFor each node of a tree, sum the strengths of shakes that spread outward from K crash points, halving (splitting by degree) at each branch.	Medium7	TreeDFS+2	No attempts yet	7s	1024 MB	Judgeable
FishingEach fish is an interval moving horizontally at its own speed; pick one time and one position to stab so that the maximum number of moving intervals contain that point.	Medium7	GeometrySorting+2	No attempts yet	1s	512 MB	Judgeable
100 meter dashGiven GPS points with timestamps and constant speed between them, find the minimum time to cover exactly 100 meters of path along the run.	Medium7	Two pointersGeometry+2	No attempts yet	2s	1024 MB	Judgeable
Circuit ResistanceGiven a tree whose edges carry resistances, find the maximum and minimum path resistance between any two leaf nodes.	Medium7	TreeDFS+2	No attempts yet	1s	512 MB	Judgeable
Good InfluencersGiven a tree where each node is initially willing or not and has a cost, repeatedly pay a willing node to convert all its neighbors, and find the minimum total cost so that everyone ends up willing.	Medium7	TreeDFS+2	No attempts yet	1s	1024 MB	Judgeable
Redistributing GiftsEach cow has a full preference ranking of the N gifts; find, for every cow, the best gift she can receive in some permutation where no cow gets a gift she likes less than her original one.	Medium7	GraphGreedy+2	No attempts yet	2s	1024 MB	Judgeable