two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5673	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	(None)
	5692	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	(None)
	5708	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	(None)
	5712	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	(None)
	5733	P1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	(None)
	5734	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	(None)
	5735	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	(None)
	5742	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	(None)
	5760	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	(None)
	5789	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	5808	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	(None)
	5812	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	(None)
	5815	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	(None)
	5826	P1497E2 Square-free division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	(None)
	5837	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	(None)
	5842	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
	5882	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)
	5884	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	(None)
	5893	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	(None)
	5898	P1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	(None)

Pick a problem randomly based on the current filter.