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

Problemset

10 problems · filtered by 3 tags

#	Name	Rating↕	Solved↕
2207H1	Bowser's Castle (Easy Version) binary search constructive algorithms divide and conquer greedy interactive trees	unrated	60
2207H2	Bowser's Castle (Medium Version) constructive algorithms divide and conquer interactive trees two pointers	unrated	51
2207H3	Bowser's Castle (Hard Version) constructive algorithms divide and conquer interactive trees two pointers	unrated	69
2106G1	Baudelaire (easy version) binary search constructive algorithms divide and conquer greedy interactive trees	2200	1.7k
2106G2	Baudelaire (hard version) binary search dfs and similar divide and conquer implementation interactive trees	2500	647
2001C	Guess The Tree binary search brute force dfs and similar divide and conquer dsu greedy interactive trees	1500	13.1k
1990E2	Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees	2600	1.2k
1633F	Perfect Matching data structures divide and conquer interactive trees	2800	652
1174F	Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees	2400	2.1k
772E	Verifying Kingdom binary search divide and conquer interactive trees	3200	224

showing 1–10 of 10