data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6123	P1585D Yet Another Sorting Problem data structures math *1900	0 / 0	(None)
	6124	P1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	(None)
	6126	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	(None)
	6133	P1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	(None)
	6134	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	(None)
	6140	P1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	(None)
	6141	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	(None)
	6148	P1599I Desert data structures graphs *2700	0 / 0	(None)
	6152	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	(None)
	6153	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
	6154	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	(None)
	6179	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	(None)
	6183	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	(None)
	6184	P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	(None)
	6190	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	(None)
	6196	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(None)
	6209	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	(None)
	6213	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)
	6215	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
	6227	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.