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

Problemset

13 problems · filtered by 4 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
2173F	Isla's Memory Thresholds binary search brute force data structures divide and conquer math	2600	623
2149G	Buratsuta 3 binary search brute force data structures divide and conquer probabilities	2100	2.8k
2056D	Unique Median binary search brute force combinatorics data structures divide and conquer dp	2200	3.7k
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
1998E1	Eliminating Balls With Merging (Easy Version) binary search brute force data structures divide and conquer greedy	2200	2.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
1766E	Decomposition binary search brute force data structures divide and conquer dp two pointers	2300	1.5k
1547F	Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers	1900	7.2k
1461D	Divide and Summarize binary search brute force data structures divide and conquer implementation sortings	1600	10.4k

showing 1–13 of 13