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

Problemset

12 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
2126G2	Big Wins! (hard version) binary search data structures divide and conquer dsu trees two pointers	2400	1.2k
1976D	Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	2000	5.9k
1896D	Ones and Twos binary search data structures divide and conquer math two pointers	1700	7.1k
1887D	Split binary search data structures divide and conquer dsu math trees two pointers	2700	1.3k
1849E	Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers	2300	2.3k
1766E	Decomposition binary search brute force data structures divide and conquer dp two pointers	2300	1.5k
1691D	Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers	1800	7.7k
1548B	Integers Have Friends binary search data structures divide and conquer math number theory two pointers	1800	11.6k
1547F	Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers	1900	7.2k
1428F	Fruit Sequences binary search data structures divide and conquer dp two pointers	2400	2.6k
833B	The Bakery binary search data structures divide and conquer dp two pointers	2200	6.8k

showing 1–12 of 12