|
|
Count the Derangements |
math
combinatorics
|
0 |
— |
1600 |
|
|
Perfect Power |
math
|
0 |
— |
1600 |
|
|
Largest Concatenation |
greedy
sorting
|
0 |
— |
1600 |
|
|
Fewest Jumps to the End |
greedy
|
0 |
— |
1600 |
|
|
Around the Circuit |
greedy
|
0 |
— |
1600 |
|
|
Smallest Impossible Sum |
greedy
sorting
|
0 |
— |
1600 |
|
|
Smallest Sufficient Capacity |
binary-search
|
0 |
— |
1600 |
|
|
Minimum Eating Speed |
binary-search
|
0 |
— |
1600 |
|
|
Fair Reading Load |
binary-search
|
0 |
— |
1600 |
|
|
Search a Rotated Array |
binary-search
|
0 |
— |
1600 |
|
|
Loot on a Ring Road |
dp
|
0 |
— |
1600 |
|
|
Longest Increasing Subsequence |
dp
binary-search
|
0 |
— |
1600 |
|
|
Two Equal Piles |
dp
|
1 |
|
1600 |
|
|
The 0/1 Knapsack |
dp
|
1 |
|
1600 |
|
|
Unlimited Supplies |
dp
|
0 |
— |
1600 |
|
|
Delete and Earn |
dp
|
0 |
— |
1600 |
|
|
Longest Common Subsequence |
strings
dp
|
0 |
— |
1600 |
|
|
Largest All-Ones Square |
dp
|
0 |
— |
1600 |
|
|
Two Lonely Numbers |
bitwise
|
0 |
— |
1600 |
|
|
Deadlock Detection |
graphs
|
12 |
|
1600 |
|
|
Schedule the Courses |
graphs
sorting
|
0 |
— |
1600 |
|
|
The Rot Spreads |
bfs
graphs
|
0 |
— |
1600 |
|
|
Diameter of a Tree |
bfs
trees
|
0 |
— |
1600 |
|
|
Sliding Window Minimum |
sliding-window
stack
|
0 |
— |
1600 |
|
|
Static Range Minimum |
sparse-table
|
0 |
— |
1600 |
|
|
Farthest by Manhattan |
math
geometry
|
0 |
— |
1600 |
|
|
Zero Triplets |
sorting
two-pointers
|
0 |
— |
1600 |
|
|
Longest Common Substring |
strings
dp
|
0 |
— |
1600 |
|
|
Number Spiral |
math
|
0 |
— |
1600 |
|
|
Counting a Digit |
math
|
0 |
— |
1600 |
|
|
Numbers That Contain D |
math
|
0 |
— |
1600 |
|
|
Two Peaceful Knights |
math
combinatorics
|
0 |
— |
1600 |
|
|
Range Products, Zeros Included |
math
prefix-sums
|
0 |
— |
1600 |
|
|
Independent Cycles |
math
graphs
union-find
|
0 |
— |
1600 |
|
|
The Mountain Subsequence |
dp
|
0 |
— |
1600 |
|
|
Trim to Non-Decreasing |
dp
binary-search
|
0 |
— |
1600 |
|
|
The Fairest Cut |
dp
|
0 |
— |
1600 |
|
|
Kadane, Minus One |
dp
|
0 |
— |
1600 |
|
|
Longest Path in a DAG |
dp
graphs
|
0 |
— |
1600 |
|
|
All Inverses at Once |
number-theory
|
0 |
— |
1600 |
|
|
Static Range AND |
sparse-table
|
0 |
— |
1600 |
|
|
Static Range OR |
sparse-table
|
0 |
— |
1600 |
|
|
Static Range Maximum |
sparse-table
|
0 |
— |
1600 |
|
|
Fair Candy for Ratings |
greedy
|
0 |
— |
1600 |
|
|
Add, Assign, Range Sum |
fenwick
|
0 |
— |
1600 |
|
|
Exactly K Odd Numbers |
two-pointers
|
0 |
— |
1600 |
|
|
Binary Strings Avoiding 111 |
combinatorics
matrix-exponentiation
|
0 |
— |
1600 |
|
|
Longest Non-Decreasing Subsequence |
dp
binary-search
|
0 |
— |
1600 |
|
|
Counting Subsets with Given Sum |
dp
knapsack
|
0 |
— |
1600 |
|
|
Maximum Circular Subarray |
dp
|
0 |
— |
1700 |
