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

Problemset

6 problems · filtered by 4 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
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
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
914E	Palindromes in a Tree bitmasks data structures divide and conquer trees	2400	2k

showing 1–6 of 6