Problem Set - strings - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2014	codeforces#P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	4
	2005	codeforces#P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2004	codeforces#P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	1998	codeforces#P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	1994	codeforces#P1539B Love Song dp implementation strings *800	0 / 0	3
	1959	codeforces#P1547B Alphabetical Strings greedy implementation strings *800	0 / 0	3
	1941	codeforces#P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	1938	codeforces#P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	3
	1936	codeforces#P1551C Interesting Story greedy sortings strings *1500	0 / 0	5
	1931	codeforces#P1552A Subsequence Permutation sortings strings *800	0 / 0	3
	1921	codeforces#P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	1919	codeforces#P1553D Backspace dp greedy strings two pointers *1500	0 / 0	5
	1910	codeforces#P1554D Diane constructive algorithms greedy strings *1800	0 / 0	6
	1905	codeforces#P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	5
	1874	codeforces#P1560D Make a Power of Two greedy math strings *1300	0 / 0	4
	1873	codeforces#P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	6
	1862	codeforces#P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	9
	1851	codeforces#P1567A Domino Disaster implementation strings *800	0 / 0	3
	1815	codeforces#P1575A Another Sorting Problem data structures sortings strings *1100	0 / 0	3
	1808	codeforces#P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	8
	1794	codeforces#P1578H Higher Order Functions implementation strings *1700	0 / 0	5
	1788	codeforces#P1579A Casimir's String Solitaire math strings *800	0 / 0	3
	1770	codeforces#P1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	4
	1751	codeforces#P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	10
	1723	codeforces#P1594C Make Them Equal brute force greedy math strings *1200	0 / 0	4
	1712	codeforces#P1598G The Sum of Good Numbers hashing math string suffix structures strings *3200	0 / 0	10
	1680	codeforces#P1605C Dominant Character brute force greedy implementation strings *1400	0 / 0	4
	1676	codeforces#P1606A AB Balance strings *900	0 / 0	3
	1670	codeforces#P1607A Linear Keyboard implementation strings *800	0 / 0	3
	1656	codeforces#P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	10
	1654	codeforces#P1609B William the Vigilant implementation strings *1100	0 / 0	3
	1602	codeforces#P1616B Mirror in the String greedy strings *1100	0 / 0	3
	1599	codeforces#P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	1595	codeforces#P1617A Forbidden Subsequence constructive algorithms greedy sortings strings *800	0 / 0	3
	1584	codeforces#P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	1582	codeforces#P1619A Square String? implementation strings *800	0 / 0	3
	1548	codeforces#P1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	9
	1544	codeforces#P1624D Palindromes Coloring binary search greedy sortings strings *1400	0 / 0	4
	1543	codeforces#P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	7
	1533	codeforces#P1626B Minor Reduction greedy strings *1100	0 / 0	3
	1521	codeforces#P1628B Peculiar Movie Preferences greedy strings *1700	0 / 0	5
	1493	codeforces#P1634A Reverse and Concatenate greedy strings *800	0 / 0	3
	1484	codeforces#P1635D Infinite Set bitmasks dp math matrices number theory strings *1800	0 / 0	6
	1422	codeforces#P1650A Deletions of Two Adjacent Letters implementation strings *800	0 / 0	3
	1408	codeforces#P1654B Prefix Removals strings *800	0 / 0	3
	1404	codeforces#P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1378	codeforces#P1659B Bit Flipping bitmasks constructive algorithms greedy strings *1300	0 / 0	4
	1371	codeforces#P1660C Get an Even String dp greedy strings *1300	0 / 0	4
	1368	codeforces#P1660F1 Promising String (easy version) brute force implementation math strings *1700	0 / 0	5
	1367	codeforces#P1660F2 Promising String (hard version) data structures implementation math strings *2100	0 / 0	7
	1359	codeforces#P1662B Toys greedy strings	0 / 0	(None)
	1357	codeforces#P1662D Evolution of Weasels greedy implementation strings	0 / 0	(None)
	1340	codeforces#P1663F In Every Generation... *special problem strings	0 / 0	(None)
	1339	codeforces#P1663G Six Characters *special problem constructive algorithms strings	0 / 0	(None)
	1308	codeforces#P1669E 2-Letter Strings data structures math strings *1200	0 / 0	4
	1303	codeforces#P1670B Dorms War brute force implementation strings *1100	0 / 0	3
	1282	codeforces#P1673A Subtle Substring Subtraction games greedy strings *800	0 / 0	3
	1281	codeforces#P1673B A Perfectly Balanced String? brute force greedy strings *1100	0 / 0	3
	1274	codeforces#P1674C Infinite Replacement combinatorics implementation strings *1000	0 / 0	3
	1265	codeforces#P1675E Replace With the Previous, Minimize dsu greedy strings *1500	0 / 0	5
	1260	codeforces#P1676C Most Similar Words brute force greedy implementation implementation math strings *800	0 / 0	3
	1240	codeforces#P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	9
	1236	codeforces#P1680C Binary String binary search greedy strings two pointers *1600	0 / 0	5
	1226	codeforces#P1682A Palindromic Indices greedy strings *800	0 / 0	3
	1220	codeforces#P1684A Digit Minimization constructive algorithms games math strings *800	0 / 0	3
	1211	codeforces#P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1196	codeforces#P1688C Manipulating History constructive algorithms greedy strings *1700	0 / 0	5
	1185	codeforces#P1690F Shifting String graphs math number theory strings *1700	0 / 0	5
	1181	codeforces#P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	1145	codeforces#P1697C awoo's Favorite Problem binary search constructive algorithms data structures greedy implementation strings two pointers *1400	0 / 0	4
	1119	codeforces#P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	1109	codeforces#P1703A YES or YES? brute force implementation strings *800	0 / 0	3
	1107	codeforces#P1703C Cypher brute force implementation strings *800	0 / 0	3
	1106	codeforces#P1703D Double Strings brute force data structures strings *1100	0 / 0	3
	1096	codeforces#P1704G Mio and Lucky Array constructive algorithms fft math strings *3500	0 / 0	10
	1087	codeforces#P1706A Another String Minimization Problem 2-sat constructive algorithms greedy string suffix structures strings *800	0 / 0	3
	1071	codeforces#P1709C Recover an RBS constructive algorithms greedy implementation strings *1800	0 / 0	6
	1044	codeforces#P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	1009	codeforces#P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	1008	codeforces#P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	1002	codeforces#P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	964	codeforces#P1729B Decode String greedy strings *800	0 / 0	3
	963	codeforces#P1729C Jumping on Tiles constructive algorithms strings *1100	0 / 0	3
	959	codeforces#P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	955	codeforces#P1730D Prefixes and Suffixes constructive algorithms strings two pointers *2200	0 / 0	8
	925	codeforces#P1735C Phase Shift dfs and similar dsu graphs greedy implementation strings *1400	0 / 0	4
	917	codeforces#P1736D Equal Binary Subsequences constructive algorithms geometry greedy implementation strings *2200	0 / 0	8
	915	codeforces#P1737A Ela Sorting Books greedy implementation strings *900	0 / 0	3
	901	codeforces#P1738H Palindrome Addicts data structures strings *3300	0 / 0	10
	895	codeforces#P1739F Keyboard Design bitmasks data structures dp string suffix structures strings *2600	0 / 0	10
	885	codeforces#P1741A Compare T-Shirt Sizes implementation implementation strings *800	0 / 0	3
	873	codeforces#P1742F Smaller constructive algorithms greedy strings *1500	0 / 0	5
	843	codeforces#P1748B Diverse Substrings brute force implementation strings *1400	0 / 0	4
	828	codeforces#P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	827	codeforces#P1750F Majority combinatorics dp math strings *2700	0 / 0	10
	815	codeforces#P1758A SSeeeeiinngg DDoouubbllee constructive algorithms strings *800	0 / 0	3
	809	codeforces#P1759A Yes-Yes? implementation strings *800	0 / 0	3
	801	codeforces#P1760B Atilla's Favorite Problem greedy implementation strings *800	0 / 0	3
	721	codeforces#P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	719	codeforces#P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9

Pick a problem randomly based on the current filter.