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

Problemset

30 problems · filtered by 2 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
2207H2	Bowser's Castle (Medium Version) constructive algorithms divide and conquer interactive trees two pointers	unrated	51
2207H3	Bowser's Castle (Hard Version) constructive algorithms divide and conquer interactive trees two pointers	unrated	69
2203F	Binary Search with One Swap binary search divide and conquer dp hashing math two pointers	2600	457
2154E	No Mind To Think binary search divide and conquer greedy sortings ternary search two pointers	2500	1.2k
2126G2	Big Wins! (hard version) binary search data structures divide and conquer dsu trees two pointers	2400	1.2k
2006C	Eri and Expanded Sets data structures divide and conquer math number theory two pointers	2300	2.1k
2003E2	Turtle and Inversions (Hard Version) brute force data structures divide and conquer dp greedy math two pointers	2700	654
1990F	Polygonal Segments brute force data structures divide and conquer dp greedy two pointers	2800	464
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
1787I	Treasure Hunt data structures divide and conquer two pointers	3400	424
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
1665E	MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers	2500	1.9k
1619H	Permutation and Queries brute force data structures divide and conquer two pointers	2400	1.5k
1609F	Interesting Sections data structures divide and conquer meet-in-the-middle two pointers	2800	1.1k
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
1438E	Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers	2500	1.5k
1428F	Fruit Sequences binary search data structures divide and conquer dp two pointers	2400	2.6k
1418G	Three Occurrences data structures divide and conquer hashing two pointers	2500	2.9k
1190D	Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers	2000	2.7k
1175G	Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers	3000	859
1156E	Special Segments of Permutation data structures divide and conquer dsu two pointers	2200	4.2k
1042D	Petya and Array data structures divide and conquer two pointers	1800	7.6k
833B	The Bakery binary search data structures divide and conquer dp two pointers	2200	6.8k
364E	Empty Rectangles divide and conquer two pointers	3000	734

showing 1–30 of 30