two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2592	P1148E Earth Wind and Fire constructive algorithms greedy math sortings two pointers *2300	0 / 0	(None)
	2547	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	(None)
	2545	P1156E Special Segments of Permutation data structures divide and conquer dsu two pointers *2200	0 / 0	(None)
	2536	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	(None)
	2534	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	(None)
	2506	P1166C A Tale of Two Lands binary search sortings two pointers *1500	0 / 0	(None)
	2498	P1167E Range Deleting binary search combinatorics data structures two pointers *2100	0 / 0	(None)
	2494	P1168B Good Triple brute force two pointers *1900	0 / 0	(None)
	2458	P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	(None)
	2430	P1181D Irrigation binary search data structures implementation sortings trees two pointers *2200	0 / 0	(None)
	2376	P1188B Count Pairs math matrices number theory two pointers *2300	0 / 0	(None)
	2369	P1190A Tokitsukaze and Discard Items implementation two pointers *1400	0 / 0	(None)
	2366	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	(None)
	2350	P1194F Crossword Expert combinatorics dp number theory probabilities two pointers *2400	0 / 0	(None)
	2343	P1195E OpenStreetMap data structures two pointers *2100	0 / 0	(None)
	2337	P1196D2 RGB Substring (hard version) data structures dp implementation two pointers *1600	0 / 0	(None)
	2328	P1198A MP3 sortings two pointers *1600	0 / 0	(None)
	2317	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	(None)
	2298	P1203D2 Remove the Substring (hard version) binary search greedy implementation two pointers *1700	0 / 0	(None)
	2272	P1208B Uniqueness binary search brute force implementation two pointers *1500	0 / 0	(None)

Pick a problem randomly based on the current filter.