11,311/11,320 captured·📄 81 PDFs⊘ 0 skipped9 remaining100%

Problemset

15 problems · filtered by 3 tags

#	Name	Rating↕	Solved↕
2236G	Criterion in Burlandia binary search bitmasks brute force data structures dfs and similar divide and conquer implementation trees two pointers	2600	385
2163D1	Diadrash (Easy Version) binary search brute force divide and conquer implementation interactive	2100	2.8k
2048F	Kevin and Math Class brute force data structures divide and conquer dp implementation math trees	2500	1.3k
2042E	Vertex Pairs binary search brute force data structures dfs and similar divide and conquer greedy implementation trees	2900	535
2005D	Alter the GCD binary search brute force data structures divide and conquer implementation number theory	2400	1.3k
1998E2	Eliminating Balls With Merging (Hard Version) binary search brute force data structures divide and conquer greedy implementation	2500	927
1997E	Level Up binary search brute force data structures divide and conquer implementation	2200	3.9k
1988E	Range Minimum Sum binary search brute force data structures divide and conquer implementation	2300	1.9k
1956D	Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math	2000	4.9k
1951E	No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings	2000	4.6k
1921G	Mischievous Shooter brute force data structures divide and conquer dp implementation	2200	1.5k
1793F	Rebrending brute force data structures divide and conquer implementation	2600	1.7k
1665E	MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers	2500	1.9k
1461D	Divide and Summarize binary search brute force data structures divide and conquer implementation sortings	1600	10.4k
1385D	a-Good String bitmasks brute force divide and conquer dp implementation	1500	22.3k

showing 1–15 of 15