two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5302	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
	5303	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
	5305	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	(None)
	5320	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	(None)
	5324	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	(None)
	5350	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	(None)
	5362	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	(None)
	5381	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
	5384	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
	5401	P1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	(None)
	5409	P1366B Shuffle math two pointers *1300	0 / 0	(None)
	5411	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
	5417	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(None)
	5426	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
	5450	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(None)
	5460	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	5461	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
	5465	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(None)
	5469	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
	5471	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.