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

Problemset

9 problems · filtered by 3 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
2146D1	Max Sum OR (Easy Version) bitmasks constructive algorithms divide and conquer greedy trees	1500	11.2k
1849F	XOR Partition binary search bitmasks data structures divide and conquer greedy trees	2700	911
1777F	Comfortably Numb bitmasks data structures divide and conquer strings trees	2400	1.5k
1553H	XOR and Distance bitmasks divide and conquer trees	2900	909
1446C	Xor Tree binary search bitmasks data structures divide and conquer dp trees	2100	4.2k
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
914E	Palindromes in a Tree bitmasks data structures divide and conquer trees	2400	2k

showing 1–9 of 9