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

Problemset

4 problems · filtered by 4 tags

#	Name	Rating↕	Solved↕
2074F	Counting Necessary Nodes bitmasks divide and conquer greedy implementation math	2000	2.5k
1956D	Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math	2000	4.9k
1930D2	Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	2100	3.1k
1665E	MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers	2500	1.9k

showing 1–4 of 4