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

Problemset

11 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
2042E	Vertex Pairs binary search brute force data structures dfs and similar divide and conquer greedy implementation trees	2900	535
2035D	Yet Another Real Number Problem binary search data structures divide and conquer greedy implementation math	1800	5.9k
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
1976D	Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	2000	5.9k
1691D	Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers	1800	7.7k
1461D	Divide and Summarize binary search brute force data structures divide and conquer implementation sortings	1600	10.4k
1439C	Greedy Shopping binary search data structures divide and conquer greedy implementation	2600	2.3k

showing 1–11 of 11