data structures - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2850	P1430E String Reversal data structures greedy strings *1900	0 / 0	6
	2825	P1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	9
	2819	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	8
	2817	P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	10
	2815	P1438B Valerii Against Everyone constructive algorithms data structures greedy sortings *1000	0 / 0	3
	2808	P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	10
	2807	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	2805	P1439E Cheat and Win bitmasks data structures games trees *3500	0 / 0	10
	2801	P1442B Identify the Operations combinatorics data structures dsu greedy implementation *1800	0 / 0	6
	2799	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2790	P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	9
	2783	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2782	P1446D1 Frequency Problem (Easy Version) data structures greedy *2600	0 / 0	10
	2781	P1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	10
	2779	P1446F Line Distance binary search data structures geometry *3200	0 / 0	10
	2772	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	2753	P1452G Game On Tree data structures dfs and similar greedy trees *2700	0 / 0	10
	2741	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2734	P1455G Forbidden Value data structures dp *2900	0 / 0	10
	2728	P1458D Flip and Reverse data structures graphs greedy *3100	0 / 0	10
	2727	P1458E Nim Shortcuts data structures games *3100	0 / 0	10
	2726	P1458F Range Diameter Sum data structures trees *3500	0 / 0	10
	2717	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	2702	P1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	6
	2688	P1464F My Beautiful Madness data structures trees *3500	0 / 0	10
	2682	P1466D 13th Labour of Heracles data structures greedy sortings trees *1500	0 / 0	5
	2674	P1466I The Riddle of the Sphinx binary search data structures data structures interactive *3400	0 / 0	10
	2667	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	9
	2666	P1468A LaIS data structures dp greedy *2200	0 / 0	8
	2665	P1468B Bakery data structures dsu *2900	0 / 0	10
	2662	P1468C Berpizza data structures implementation *1400	0 / 0	4
	2642	P1468M Similar Sets data structures graphs implementation *2300	0 / 0	8
	2628	P1469F Power Sockets binary search data structures greedy *2600	0 / 0	10
	2619	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2604	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	2598	P1473D Program data structures dp implementation strings *1700	0 / 0	5
	2591	P1474C Array Destruction brute force constructive algorithms data structures greedy implementation sortings *1700	0 / 0	5
	2590	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2568	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2565	P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	2564	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	10
	2560	P1477B Nezzar and Binary String data structures greedy *1900	0 / 0	6
	2554	P1477E Nezzar and Tournaments data structures greedy *3300	0 / 0	10
	2541	P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	6
	2539	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2535	P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	10
	2522	P1481E Sorting Books data structures dp greedy *2500	0 / 0	9
	2517	P1482D Playlist data structures dsu implementation shortest paths *1900	0 / 0	6
	2516	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2512	P1482H Exam data structures string suffix structures trees *3400	0 / 0	10
	2503	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	9
	2498	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2496	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	10
	2491	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2484	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	2482	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	8
	2480	P1488G Painting Numbers special problem data structures greedy number theory 2500	0 / 0	9
	2478	P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	10
	2474	P1488J Flower Shop special problem data structures fft math 3100	0 / 0	10
	2464	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	2463	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2460	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	6
	2455	P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	5
	2444	P1491H Yuezheng Ling and Dynamic Tree data structures trees *3400	0 / 0	10
	2442	P1491I Ruler Of The Zoo brute force data structures *3500	0 / 0	10
	2439	P1492B Card Deck data structures greedy math *1100	0 / 0	3
	2438	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2432	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	1 / 2	7
	2422	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	2421	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	9
	2411	P1495E Qingshan and Daniel brute force data structures greedy implementation *3200	0 / 0	10
	2410	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	10
	2405	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	3
	2396	P1497E1 Square-Free Division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	5
	2394	P1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	9
	2389	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	2388	P1498C Planar Reflections brute force data structures dp *1600	0 / 0	5
	2384	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	9
	2381	P1499C Minimum Grid Path brute force data structures greedy math *1500	0 / 0	5
	2375	P1499G Graph Coloring data structures graphs interactive *3100	0 / 0	10
	2366	P1500D Tiles for Bathroom data structures sortings two pointers *2900	0 / 0	10
	2364	P1500E Subset Trick binary search data structures *3300	0 / 0	10
	2354	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2353	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	10
	2351	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	10
	2334	P1506D Epic Transformation constructive algorithms data structures greedy *1400	0 / 0	4
	2328	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2324	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2321	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	10
	2319	P1508F Optimal Encoding brute force data structures *3500	0 / 0	10
	2294	P1511C Yet Another Card Deck brute force data structures implementation trees *1100	0 / 0	3
	2290	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	10
	2289	P1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 20	10
	2283	P1512D Corrupted Array constructive algorithms data structures greedy *1200	0 / 0	4
	2269	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	9
	2265	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2261	P1515C Phoenix and Towers constructive algorithms data structures greedy *1400	0 / 0	4
	2254	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	2253	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	2245	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7

Pick a problem randomly based on the current filter.