two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	657	P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	(None)
	591	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	(None)
	577	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	(None)
	576	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	(None)
	572	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	(None)
	564	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	(None)
	530	P1547C Pair Programming greedy two pointers *1100	0 / 0	(None)
	528	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(None)
	527	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(None)
	524	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
	514	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	(None)
	513	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
	491	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	(None)
	476	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	(None)
	468	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	(None)
	460	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(None)
	451	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
	428	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	(None)
	414	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	(None)
	400	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.