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

Problemset

8 problems · filtered by 3 tags

#	Name	Rating↕	Solved↕
2041J	Bottle Arrangement data structures divide and conquer dp dsu greedy	2700	273
1930D2	Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	2100	3.1k
1849E	Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers	2300	2.3k
1681F	Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees	2300	2.4k
1671E	Preorder combinatorics divide and conquer dp dsu hashing sortings trees	2100	3.3k
1550F	Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths	2700	958
1156D	0-1-Tree dfs and similar divide and conquer dp dsu trees	2200	4.9k
990G	GCD Counting divide and conquer dp dsu number theory trees	2400	2.4k

showing 1–8 of 8