Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
1950-E Nearly Shortest Repeating Substring
brute force implementation number theory +1
1500
1950-D Product of Binary Decimals
brute force dp implementation +1
1100
1950-C Clock Conversion
implementation math
800
1950-B Upscaling
implementation
800
1950-A Stair, Peak, or Neither?
implementation
800
1949-K Make Triangle
constructive algorithms math
2800
1949-J Amanda the Amoeba
graphs implementation trees +1
2600
1949-I Disks
dfs and similar geometry graph matchings +1
1800
1949-H Division Avoidance
greedy math
3100
1949-G Scooter
graphs greedy
2300
1949-F Dating
greedy sortings trees
2200
1949-E Damage per Second
brute force math
2900
1949-D Funny or Scary?
constructive algorithms
2600
1949-C Annual Ants' Gathering
dfs and similar dp greedy +1
1900
1949-B Charming Meals
binary search brute force greedy +1
1500
1949-A Grove
brute force dfs and similar dp +2
3300
1948-G MST with Matching
bitmasks brute force dsu +2
3100
1948-F Rare Coins
combinatorics math probabilities
2500
1948-E Clique Partition
brute force constructive algorithms graphs +2
2100
1948-D Tandem Repeats?
brute force strings two pointers
1700
1948-C Arrow Path
brute force constructive algorithms dfs and similar +3
1300
1948-B Array Fix
brute force dp greedy +1
1100
1948-A Special Characters
brute force constructive algorithms
800
1946-F Nobody is needed
2-sat data structures dfs and similar +1
2500
1946-E Girl Permutation
combinatorics dp math +1
2200
1946-D Birthday Gift
bitmasks brute force constructive algorithms +2
1900
1946-C Tree Cutting
binary search dp greedy +2
1600
1946-B Maximum Sum
dp greedy math
1100
1946-A Median of an Array
greedy implementation sortings
800
1945-H GCD is Greater
brute force data structures math +1
2600
1945-G Cook and Porridge
binary search constructive algorithms data structures +1
2500
1945-F Kirill and Mushrooms
data structures sortings
1900
1945-E Binary Search
binary search constructive algorithms greedy
1700
1945-D Seraphim the Owl
dp greedy
1300
1945-C Left and Right Houses
brute force
1200
1945-B Fireworks
math number theory
900
1945-A Setting up Camp
greedy math
800
1944-B Equal XOR
bitmasks constructive algorithms
1100
1944-A Destroying Bridges
graphs greedy math
800
1943-F Minimum Hamming Distance
dp
3500
1943-E2 MEX Game 2 (Hard Version)
binary search greedy two pointers
3300
1943-E1 MEX Game 2 (Easy Version)
binary search brute force greedy
2900
1943-D2 Counting Is Fun (Hard Version)
combinatorics dp
2800
1943-D1 Counting Is Fun (Easy Version)
brute force combinatorics dp +1
2400
1943-C Tree Compass
constructive algorithms dfs and similar greedy +1
2300
1943-B Non-Palindromic Substring
hashing implementation math +1
2000
1943-A MEX Game 1
games greedy
1300
1942-H Farmer John's Favorite Intern
data structures dp flows +1
3500
1942-G Bessie and Cards
combinatorics dp math
2800
1942-F Farmer John's Favorite Function
brute force data structures implementation +1
2700