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

Problemset

14 problems · filtered by 2 tags

#	Name	Rating↕	Solved↕
2249E1	String (Easy Version) divide and conquer implementation strings	unrated	103
2249E2	String (Hard Version) divide and conquer implementation strings	unrated	70
2200H	Six Seven divide and conquer math number theory strings trees	2600	528
1951E	No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings	2000	4.6k
1930D2	Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	2100	3.1k
1777F	Comfortably Numb bitmasks data structures divide and conquer strings trees	2400	1.5k
1750E	Bracket Cost binary search data structures divide and conquer dp greedy strings	2400	1.7k
1654F	Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings	2800	1.5k
1466G	Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings	2600	1.1k
1416C	XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees	2000	5.2k
1285D	Dr. Evil Underscores bitmasks brute force dfs and similar divide and conquer dp greedy strings trees	1900	8.7k
1043G	Speckled Band data structures divide and conquer hashing string suffix structures strings	3500	329
665E	Beautiful Subarrays data structures divide and conquer strings trees	2100	4.7k
559B	Equivalent Strings divide and conquer hashing sortings strings	1700	11.8k

showing 1–14 of 14