data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9229	P1955D Inaccurate Subsequence Search data structures two pointers *1400	0 / 0	4
	9224	P1956A Nene's Game binary search brute force data structures games greedy *800	0 / 0	3
	9218	P1956F Nene and the Passing Game constructive algorithms data structures dsu graphs sortings *3000	0 / 0	10
	9212	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10
	9211	P1957F2 Frequency Mismatch (Hard Version) binary search data structures dfs and similar hashing probabilities trees *2700	0 / 0	10
	9205	P1965F Conference data structures flows *3300	0 / 0	10
	9199	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9195	P1967F Next and Prev brute force data structures implementation *3200	0 / 0	10
	9189	P1968F Equal XOR Segments binary search data structures *1800	0 / 0	6
	9188	P1968G1 Division + LCP (easy version) binary search data structures dp hashing string suffix structures strings *1900	0 / 0	6
	9187	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	9183	P1969D Shop Game data structures greedy math sortings *1900	0 / 0	6
	9182	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	9306	P1971G XOUR data structures dsu sortings *1700	0 / 0	5
	9303	P1973B Cat, Fox and the Lonely Array binary search bitmasks data structures greedy math two pointers *1300	0 / 0	4
	9296	P1974C Beautiful Triple Pairs combinatorics data structures *1400	0 / 0	4
	9293	P1974F Cutting Game binary search brute force data structures implementation sortings two pointers *1900	0 / 0	6
	9292	P1974G Money Buys Less Happiness Now data structures greedy sortings *2000	0 / 0	7
	9287	P1975E Chain Queries binary search data structures dfs and similar implementation trees *2100	0 / 0	7
	9279	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	0 / 0	(None)

Pick a problem randomly based on the current filter.