two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	94	P1628A Meximum Array binary search constructive algorithms greedy implementation math two pointers *1400	0 / 0	(None)
	84	P1630B Range and Partition binary search constructive algorithms data structures greedy two pointers *1800	0 / 0	(None)
	83	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	(None)
	74	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	(None)
	40	P1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	(None)
	25	P1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	(None)
	13	P1646B Quality vs Quantity brute force constructive algorithms greedy sortings two pointers *800	0 / 0	(None)
	7719	P1676F Longest Strike data structures greedy implementation sortings two pointers *1300	0 / 0	(None)
	7698	P1680C Binary String binary search greedy strings two pointers *1600	0 / 0	(None)
	7683	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	(None)
	7678	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	(None)
	7677	P1684F Diverse Segments data structures two pointers *2600	0 / 0	(None)
	7657	P1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	(None)
	7649	P1690D Black and White Stripe implementation two pointers *1000	0 / 0	(None)
	7648	P1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	(None)
	7644	P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	(None)
	7642	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	(None)
	7635	P1692E Binary Deque binary search implementation two pointers	0 / 0	(None)
	7633	P1692G 2^Sort data structures dp sortings two pointers	0 / 0	(None)
	7748	P1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	(None)

Pick a problem randomly based on the current filter.