two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1507	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(None)
	1481	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	(None)
	1480	P1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	(None)
	1468	P1366B Shuffle math two pointers *1300	0 / 0	(None)
	1465	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
	1457	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(None)
	1456	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
	1444	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
	1422	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(None)
	1410	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(None)
	1408	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(None)
	1395	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	1394	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
	1387	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(None)
	1382	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	(None)
	1380	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(None)
	1379	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
	1375	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
	1345	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	(None)
	1321	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(None)

Pick a problem randomly based on the current filter.