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

Problemset

12 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
2187F1	Al Fine (Maximizing Version) binary search data structures divide and conquer trees	3100	256
2126G2	Big Wins! (hard version) binary search data structures divide and conquer dsu trees two pointers	2400	1.2k
2042E	Vertex Pairs binary search brute force data structures dfs and similar divide and conquer greedy implementation trees	2900	535
1990E2	Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees	2600	1.2k
1957F1	Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees	2600	706
1887D	Split binary search data structures divide and conquer dsu math trees two pointers	2700	1.3k
1849F	XOR Partition binary search bitmasks data structures divide and conquer greedy trees	2700	911
1748E	Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees	2300	2.8k
1706E	Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees	2300	4k
1446C	Xor Tree binary search bitmasks data structures divide and conquer dp trees	2100	4.2k
150E	Freezing with Style binary search data structures divide and conquer trees	3000	1.1k

showing 1–12 of 12