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

Problemset

8 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
2003E2	Turtle and Inversions (Hard Version) brute force data structures divide and conquer dp greedy math two pointers	2700	654
1990F	Polygonal Segments brute force data structures divide and conquer dp greedy two pointers	2800	464
1766E	Decomposition binary search brute force data structures divide and conquer dp two pointers	2300	1.5k
1665E	MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers	2500	1.9k
1619H	Permutation and Queries brute force data structures divide and conquer two pointers	2400	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–8 of 8