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

Problemset

10 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
2196E1	Fuzzy Concatenation (Easy Version) binary search bitmasks brute force data structures greedy string suffix structures	2900	311
2147E	Maximum OR Popcount binary search bitmasks brute force data structures greedy	2300	2.2k
2111G	Divisible Subarrays binary search bitmasks brute force data structures interactive	2900	422
2064D	Eating binary search bitmasks brute force data structures dp greedy trees two pointers	1900	6k
1878G	wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees	2300	1.5k
1705E	Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy	2300	2.5k
1598F	RBS binary search bitmasks brute force data structures dp	2400	1.7k
1479D	Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees	2900	1.4k
979D	Kuro and GCD and XOR and SUM binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees	2200	2.3k

showing 1–10 of 10