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
2064D	Eating binary search bitmasks brute force data structures dp greedy trees two pointers	1900	6k
2040D	Non Prime Tree brute force constructive algorithms dfs and similar greedy number theory trees two pointers	1900	5.9k
1805E	There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers	2300	2k
1761E	Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers	2400	2.2k
1720D1	Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers	1800	6.8k
1698E	PermutationForces II brute force combinatorics greedy sortings trees two pointers	2300	1.9k
1559D2	Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers	2500	3.2k
1285E	Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers	2300	2k

showing 1–9 of 9