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

Problemset

21 problems · filtered by 3 tags

#	Name	Rating↕	Solved↕
2157G	Isaac's Queries bitmasks brute force constructive algorithms dfs and similar divide and conquer dp greedy interactive math probabilities	2800	672
2146E	Yet Another MEX Problem brute force constructive algorithms data structures divide and conquer greedy hashing	2300	2.2k
2122D	Traffic Lights brute force data structures divide and conquer dp graphs greedy shortest paths	2400	2.8k
2101B	Quartet Swapping brute force data structures divide and conquer greedy sortings	1800	8.1k
2042E	Vertex Pairs binary search brute force data structures dfs and similar divide and conquer greedy implementation trees	2900	535
2003E1	Turtle and Inversions (Easy Version) brute force divide and conquer dp greedy math	2600	902
2003E2	Turtle and Inversions (Hard Version) brute force data structures divide and conquer dp greedy math two pointers	2700	654
2001C	Guess The Tree binary search brute force dfs and similar divide and conquer dsu greedy interactive trees	1500	13.1k
1998E1	Eliminating Balls With Merging (Easy Version) binary search brute force data structures divide and conquer greedy	2200	2.3k
1998E2	Eliminating Balls With Merging (Hard Version) binary search brute force data structures divide and conquer greedy implementation	2500	927
1990F	Polygonal Segments brute force data structures divide and conquer dp greedy two pointers	2800	464
1956D	Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math	2000	4.9k
1951E	No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings	2000	4.6k
1817E	Half-sum brute force divide and conquer greedy	3400	350
1790F	Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees	2100	4.2k
1693D	Decinc Dividing brute force data structures divide and conquer dp greedy	2800	1.2k
1665E	MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers	2500	1.9k
1580D	Subsequence brute force divide and conquer dp greedy trees	2900	1.2k
1285D	Dr. Evil Underscores bitmasks brute force dfs and similar divide and conquer dp greedy strings trees	1900	8.7k
1155D	Beautiful Array brute force data structures divide and conquer dp greedy	1900	7.9k
343E	Pumping Stations brute force dfs and similar divide and conquer flows graphs greedy trees	2900	960

showing 1–21 of 21