strings - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4096	P1243B2 Character Swap (Hard Version) strings *1600	0 / 0	5
	4055	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
	4054	P1251B Binary Palindromes greedy strings *1400	0 / 0	4
	4037	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	3980	P1256F Equalizing Two Strings constructive algorithms sortings strings *2000	0 / 0	7
	3973	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3879	P1267L Lexicography constructive algorithms strings *1800	0 / 0	6
	3877	P1268A Long Beautiful Integer constructive algorithms greedy implementation strings *1700	0 / 0	5
	3855	P1270F Awesome Substrings math strings *2600	0 / 0	10
	3826	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	8
	3806	P1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	3
	3760	P1282D Enchanted Artifact constructive algorithms interactive strings *2300	0 / 0	8
	3746	P1284A New Year and Naming implementation strings *800	0 / 0	3
	3732	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3715	P1286E Fedya the Potter Strikes Back data structures strings *3200	0 / 0	10
	3697	P1290B Irreducible Anagrams binary search constructive algorithms data structures strings two pointers *1800	0 / 0	6
	3687	P1291A Even But Not Even greedy math strings *900	0 / 0	3
	3664	P1295B Infinite Prefixes math strings *1700	0 / 0	5
	3663	P1295C Obtain The String dp greedy strings *1600	0 / 0	5
	3622	P1297H Paint the String *special problem dp strings	0 / 0	(None)
	3613	P1301A Three Strings implementation strings *800	0 / 0	3
	3611	P1301C Ayoub's function binary search combinatorics greedy math strings *1700	0 / 0	5
	3597	P1303A Erasing Zeroes implementation strings *800	0 / 0	3
	3593	P1303E Erase Subsequences dp strings *2200	0 / 0	8
	3589	P1304B Longest Palindrome brute force constructive algorithms greedy implementation strings *1100	0 / 0	3
	3582	P1305B Kuroni and Simple Strings constructive algorithms greedy strings two pointers *1200	0 / 0	4
	3573	P1307C Cow and Message brute force dp math strings *1500	0 / 0	5
	3564	P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	10
	3530	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	3528	P1315B Homecoming binary search dp greedy strings *1300	0 / 0	4
	3521	P1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 1	4
	3505	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	9
	3498	P1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	5
	3480	P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	3
	3461	P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	5
	3459	P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	6
	3406	P1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
	3397	P1332C K-Complete Word dfs and similar dsu greedy implementation strings *1500	0 / 0	5
	3359	P1336C Kaavi and Magic Spell dp strings *2200	0 / 0	8
	3336	P1342B Binary Period constructive algorithms strings *1100	0 / 0	3
	3306	P1348C Phoenix and Distribution constructive algorithms greedy sortings strings *1600	0 / 0	5
	3218	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	3205	P1363B Subsequence Hate implementation strings *1400	0 / 0	4
	3201	P1363F Rotating Substrings dp strings *2600	0 / 0	10
	3182	P1366G Construct the String data structures dp strings *2700	0 / 0	10
	3181	P1367A Short Substrings implementation strings *800	0 / 0	3
	3173	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	5
	3164	P1369B AccurateLee greedy implementation strings *1200	0 / 0	4
	3130	P1374C Move Brackets greedy strings *1000	0 / 0	3
	3116	P1379A Acacius and String brute force implementation strings *1500	0 / 0	5
	3102	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	4
	3101	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	3094	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	3088	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	4
	3041	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	3040	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	3035	P1394E Boboniu and Banknote Collection strings *3500	0 / 0	10
	3026	P1397A Juggling Letters greedy strings *800	0 / 0	3
	3010	P1400A String Similarity constructive algorithms strings *800	0 / 0	3
	3005	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	2991	P1404A Balanced Bitstring implementation strings *1500	0 / 0	5
	2960	P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2956	P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7
	2955	P1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	8
	2938	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2910	P1421C Palindromifier constructive algorithms strings *1400	0 / 0	4
	2903	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	10
	2872	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2861	P1428C ABBB brute force data structures greedy strings *1100	0 / 0	3
	2850	P1430E String Reversal data structures greedy strings *1900	0 / 0	6
	2839	P1431I Cyclic Shifts special problem strings 2900	0 / 0	10
	2817	P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	10
	2784	P1446B Catching Cheaters dp strings *1800	0 / 0	6
	2765	P1451B Non-Substring Subsequence dp greedy implementation strings *900	0 / 0	3
	2764	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2709	P1462B Last Year's Substring dp implementation strings *800	0 / 0	3
	2683	P1466C Canine poetry dp greedy strings *1300	0 / 0	4
	2679	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	10
	2631	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	9
	2600	P1473B String LCM brute force math number theory strings *1000	0 / 0	3
	2598	P1473D Program data structures dp implementation strings *1700	0 / 0	5
	2568	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2531	P1480A Yet Another String Game games greedy strings *800	0 / 0	3
	2528	P1481A Space Navigation greedy strings *800	0 / 0	3
	2433	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2431	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	10
	2409	P1496A Split it! brute force constructive algorithms greedy strings *900	0 / 0	3
	2379	P1499E Chaotic Merge combinatorics dp math strings *2400	0 / 0	9
	2350	P1504A Déjà Vu constructive algorithms strings *800	0 / 0	3
	2336	P1506C Double-ended Strings brute force implementation strings *1000	0 / 0	3
	2328	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2327	P1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	6
	2293	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	5
	2290	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	10
	2285	P1512C A-B Palindrome constructive algorithms implementation strings *1200	0 / 0	4
	2180	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2149	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2138	P1532F Prefixes and Suffixes *special problem strings	0 / 0	(None)
	2107	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2104	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10

Pick a problem randomly based on the current filter.