two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	342	P1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	(None)
	338	P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	(None)
	313	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	(None)
	308	P1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	(None)
	288	P1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	(None)
	283	P1599A Weights constructive algorithms greedy two pointers *2600	0 / 0	(None)
	273	P1600E Array Game games greedy two pointers *1900	0 / 0	(None)
	269	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	(None)
	250	P1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	(None)
	235	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	(None)
	232	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	(None)
	225	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	(None)
	222	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(None)
	218	P1610B Kalindrome Array greedy two pointers *1100	0 / 0	(None)
	206	P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	(None)
	204	P1611F ATM and Students binary search data structures two pointers *1800	0 / 0	(None)
	147	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(None)
	127	P1622D Shuffle combinatorics math two pointers *2000	0 / 0	(None)
	104	P1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	(None)
	96	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.