Practice Problems

Daily Challenge: Paths Around the Walls (1500) Solve it to start a streak

Practice Problems — 2000-2400

ProblemTopics Solvers Acceptance Difficulty
Range Add, Range Sum lazy-propagation segment-tree 0 — 2000
Range Add, Range Min lazy-propagation segment-tree 0 — 2000
Range Add, Range Max lazy-propagation segment-tree 0 — 2000
Twice-As-Big Pairs divide-and-conquer 0 — 2000
Job Assignment Fair graphs matching 0 — 2000
The Runner-Up Route graphs shortest-paths 0 — 2000
The Sponsor's Cable graphs greedy union-find 0 — 2000
Departments and Budgets fenwick trees euler-tour 0 — 2000
Round Trip of the Salesman dp bitmask 0 — 2000
No K Ones in a Row dp matrix-exponentiation 0 — 2000
Maximum XOR of a Subset bitwise linear-algebra 0 — 2000
The Longest Palindrome, Fast strings manacher 0 — 2000
Longest Common Extension strings binary-search hashing 0 — 2000
Maximum XOR Subarray bitwise trie 0 — 2000
Sum of Every Range math stack 0 — 2000
Primitive Right Triangles number-theory 0 — 2000
Maximum Rectangle Sum dp 0 — 2000
Onto Functions combinatorics 0 — 2000
Wildcard Matching strings dp 0 — 2000
Fewest Refuels greedy heap 0 — 2000
Tree Paths of Length K dp trees 0 — 2000
The Shortest Loop bfs graphs 0 — 2000
Ternary Strings Avoiding 22 combinatorics matrix-exponentiation 0 — 2000
Misere Nim game-theory nim 0 — 2000
No Three in a Row dp combinatorics matrix-exponentiation 1
20%
2000
Boolean Parenthesization dp interval-dp 0 — 2000
One Stroke, Every Street graphs euler-tour constructive 0 — 2000
Distinct Values in Ranges fenwick offline 0 — 2100
Is This Slice Sorted prefix-sums 0 — 2100
Bigger Than X, in a Slice binary-search segment-tree 0 — 2100
Longest Chain of Loop Clubs dp graphs scc 0 — 2100
Two Choices Each graphs 2-sat scc 0 — 2100
Everyone's Total Commute dp trees rerooting 0 — 2100
Worst Bridge on the Way trees binary-lifting 0 — 2100
Keys and Doors bfs graphs bitmask 0 — 2100
Total Digit Sum in a Range digit-dp 0 — 2100
Counting Grand Tours dp bitmask 0 — 2100
Bursting Balloons dp interval-dp 0 — 2100
Coprime Pairs number-theory mobius 0 — 2100
Sum of Pairwise GCDs number-theory 0 — 2100
Binomial Modulo Small Prime combinatorics number-theory 0 — 2100
Longest Repeat strings suffix-array 0 — 2100
Every Palindrome, Counted strings manacher 0 — 2100
Bounded Nim math games 0 — 2100
Staircase Nim math games 0 — 2100
Flip and Slide math games 0 — 2100
Two Piles, Diagonal Moves math games 0 — 2100
The Egg Drop dp 0 — 2100
The K-th Squarefree Number binary-search number-theory mobius 0 — 2100
Diameter of the Point Set geometry 0 — 2100