two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1787	P1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	(None)
	1782	P1305B Kuroni and Simple Strings constructive algorithms greedy strings two pointers *1200	0 / 0	(None)
	1751	P1312F Attack on Red Kingdom games two pointers *2500	0 / 0	(None)
	1744	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	(None)
	1715	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	(None)
	1701	P1326E Bombs data structures two pointers *2400	0 / 0	(None)
	1692	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)
	1660	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	(None)
	1657	P1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	(None)
	1645	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
	1644	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
	1641	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	(None)
	1615	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	(None)
	1610	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	(None)
	1609	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	(None)
	1567	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	(None)
	1557	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	(None)
	1548	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	(None)
	1513	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	(None)
	1509	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)

Pick a problem randomly based on the current filter.