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

Problemset

4 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
1766E	Decomposition binary search brute force data structures divide and conquer dp two pointers	2300	1.5k
1547F	Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers	1900	7.2k
1438E	Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers	2500	1.5k

showing 1–4 of 4