Problem Set - strings - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3513	P1243B2 Character Swap (Hard Version) strings *1600	0 / 0	5
	3472	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
	3471	P1251B Binary Palindromes greedy strings *1400	0 / 0	4
	3462	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	3433	P1256F Equalizing Two Strings constructive algorithms sortings strings *2000	0 / 0	7
	3430	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3383	P1267L Lexicography constructive algorithms strings *1800	0 / 0	6
	3382	P1268A Long Beautiful Integer constructive algorithms greedy implementation strings *1700	0 / 0	5
	3370	P1270F Awesome Substrings math strings *2600	0 / 0	10
	3355	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	8
	3345	P1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	3
	3321	P1282D Enchanted Artifact constructive algorithms interactive strings *2300	0 / 0	8
	3313	P1284A New Year and Naming implementation strings *800	0 / 0	3
	3303	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3295	P1286E Fedya the Potter Strikes Back data structures strings *3200	0 / 0	10
	3284	P1290B Irreducible Anagrams binary search constructive algorithms data structures strings two pointers *1800	0 / 0	6
	3279	P1291A Even But Not Even greedy math strings *900	0 / 0	3
	3261	P1295B Infinite Prefixes math strings *1700	0 / 0	5
	3260	P1295C Obtain The String dp greedy strings *1600	0 / 0	5
	3242	P1297H Paint the String *special problem dp strings	0 / 0	(None)
	3233	P1301A Three Strings implementation strings *800	0 / 0	3
	3231	P1301C Ayoub's function binary search combinatorics greedy math strings *1700	0 / 0	5
	3217	P1303A Erasing Zeroes implementation strings *800	0 / 0	3
	3213	P1303E Erase Subsequences dp strings *2200	0 / 0	8
	3209	P1304B Longest Palindrome brute force constructive algorithms greedy implementation strings *1100	0 / 0	3
	3202	P1305B Kuroni and Simple Strings constructive algorithms greedy strings two pointers *1200	0 / 0	4
	3193	P1307C Cow and Message brute force dp math strings *1500	0 / 0	5
	3186	P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	10
	3164	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	3162	P1315B Homecoming binary search dp greedy strings *1300	0 / 0	4
	3159	P1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 0	4
	3151	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	9
	3147	P1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	5
	3137	P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	3
	3123	P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	5
	3122	P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	6
	3092	P1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
	3087	P1332C K-Complete Word dfs and similar dsu greedy implementation strings *1500	0 / 0	5
	3060	P1336C Kaavi and Magic Spell dp strings *2200	0 / 0	8
	3037	P1342B Binary Period constructive algorithms strings *1100	0 / 0	3
	3007	P1348C Phoenix and Distribution constructive algorithms greedy sortings strings *1600	0 / 0	5
	2919	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	2906	P1363B Subsequence Hate implementation strings *1400	0 / 0	4
	2902	P1363F Rotating Substrings dp strings *2600	0 / 0	10
	2883	P1366G Construct the String data structures dp strings *2700	0 / 0	10
	2882	P1367A Short Substrings implementation strings *800	0 / 0	3
	2874	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	5
	2865	P1369B AccurateLee greedy implementation strings *1200	0 / 0	4
	2831	P1374C Move Brackets greedy strings *1000	0 / 0	3
	2817	P1379A Acacius and String brute force implementation strings *1500	0 / 0	5
	2803	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	4
	2802	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	2795	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	2789	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	4
	2742	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	2741	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	2736	P1394E Boboniu and Banknote Collection strings *3500	0 / 0	10
	2727	P1397A Juggling Letters greedy strings *800	0 / 0	3
	2711	P1400A String Similarity constructive algorithms strings *800	0 / 0	3
	2706	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	2692	P1404A Balanced Bitstring implementation strings *1500	0 / 0	5
	2661	P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2657	P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7
	2656	P1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	8
	2639	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2611	P1421C Palindromifier constructive algorithms strings *1400	0 / 0	4
	2604	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	10
	2573	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2562	P1428C ABBB brute force data structures greedy strings *1100	0 / 0	3
	2551	P1430E String Reversal data structures greedy strings *1900	0 / 0	6
	2540	P1431I Cyclic Shifts special problem strings 2900	0 / 0	10
	2518	P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	10
	2485	P1446B Catching Cheaters dp strings *1800	0 / 0	6
	2466	P1451B Non-Substring Subsequence dp greedy implementation strings *900	0 / 0	3
	2465	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2418	P1462B Last Year's Substring dp implementation strings *800	0 / 0	3
	2403	P1466C Canine poetry dp greedy strings *1300	0 / 0	4
	2399	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	10
	2373	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	9
	2355	P1473B String LCM brute force math number theory strings *1000	0 / 0	3
	2353	P1473D Program data structures dp implementation strings *1700	0 / 0	5
	2332	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2314	P1480A Yet Another String Game games greedy strings *800	0 / 0	3
	2312	P1481A Space Navigation greedy strings *800	0 / 0	3
	2245	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2243	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	10
	2229	P1496A Split it! brute force constructive algorithms greedy strings *900	0 / 0	3
	2210	P1499E Chaotic Merge combinatorics dp math strings *2400	0 / 0	9
	2193	P1504A Déjà Vu constructive algorithms strings *800	0 / 0	3
	2180	P1506C Double-ended Strings brute force implementation strings *1000	0 / 0	3
	2176	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2175	P1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	6
	2152	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	5
	2150	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	10
	2146	P1512C A-B Palindrome constructive algorithms implementation strings *1200	0 / 0	4
	2071	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2050	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2041	P1532F Prefixes and Suffixes *special problem strings	0 / 0	(None)
	2019	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2016	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.