String
73 solutions
- 0003 - Longest Substring Without Repeating Characters (Medium)
- 0005 - Longest Palindromic Substring (Medium)
- 0006 - Zigzag Conversion (Medium)
- 0010 - Regular Expression Matching (Hard)
- 0012 - Integer to Roman (Medium)
- 0017 - Letter Combinations of a Phone Number (Medium)
- 0022 - Generate Parentheses (Medium)
- 0049 - Group Anagrams (Medium)
- 0058 - Length of Last Word
- 0072 - Edit Distance (Hard)
- 0091 - Decode Ways (Medium)
- 0093 - Restore IP Addresses (Medium)
- 0097 - Interleaving String (Medium)
- 0115 - Distinct Subsequences (Hard)
- 0127 - Word Ladder (Hard)
- 0131 - Palindrome Partitioning (Medium)
- 0139 - Word Break (Medium)
- 0205 - Isomorphic Strings (Easy)
- 0208 - Implement Trie (Prefix Tree) (Medium)
- 0211 - Design Add and Search Words Data Structure (Medium)
- 0212 - Word Search II (Hard)
- 0242 - Valid Anagram (Easy)
- 0290 - Word Pattern (Easy)
- 0297 - Serialize and Deserialize Binary Tree (Hard)
- 0345 - Reverse Vowels of a String (Easy)
- 0383 - Ransom Note (Easy)
- 0387 - First Unique Character in a String (Easy)
- 0389 - Find the Difference (Easy)
- 0392 - Is Subsequence (Easy)
- 0412 - Fizz Buzz (Easy)
- 0424 - Longest Repeating Character Replacement (Medium)
- 0433 - Minimum Genetic Mutation (Medium)
- 0438 - Find All Anagrams in a String (Medium)
- 0451 - Sort Characters By Frequency (Medium)
- 0557 - Reverse Words in a String III (Easy)
- 0567 - Permutation in String (Medium)
- 0606 - Construct String from Binary Tree (Easy)
- 0609 - Find Duplicate File in System (Medium)
- 0647 - Palindromic Substrings (Medium)
- 0678 - Valid Parenthesis String (Medium)
- 0763 - Partition Labels (Medium)
- 0838 - Push Dominoes (Medium)
- 0844 - Backspace String Compare (Easy)
- 0899 - Orderly Queue (Hard)
- 0926 - Flip String to Monotone Increasing (Medium)
- 0944 - Delete Columns to Make Sorted (Easy)
- 0990 - Satisfiability of Equality Equations (Medium)
- 1047 - Remove All Adjacent Duplicates In String (Easy)
- 1061 - Lexicographically Smallest Equivalent String (Medium)
- 1071 - Greatest Common Divisor of Strings (Easy)
- 1143 - Longest Common Subsequence (Medium)
- 1239 - Maximum Length of a Concatenated String with Unique Characters (Medium)
- 1328 - Break a Palindrome (Medium)
- 1347 - Minimum Number of Steps to Make Two Strings Anagram (Easy)
- 1496 - Path Crossing (Easy)
- 1531 - String Compression II (Hard)
- 1544 - Make The String Great (Easy)
- 1578 - Minimum Time to Make Rope Colorful (Medium)
- 1624 - Largest Substring Between Two Equal Characters (Easy)
- 1639 - Number of Ways to Form a Target String Given a Dictionary (Hard)
- 1657 - Determine If Two Strings Are Close (Medium)
- 1662 - Check If Two String Arrays are Equivalent (Easy)
- 1704 - Determine if String Halves Are Alike (Easy)
- 1758 - Minimum Changes To Make Alternating Binary String (Easy)
- 1903 - Largest Odd Number in String (Easy)
- 1980 - Find Unique Binary String (Medium)
- 2131 - Longest Palindrome by Concatenating Two Letter Words (Medium)
- 2380 - Time Needed to Rearrange a Binary String (Medium)
- 2810 - Faulty Keyboard (Easy)
- 2864 - Maximum Odd Binary Number (Easy)
- 3090 - Maximum Length Substring With Two Occurrences (Easy)
- 3841 - Palindromic Path Queries in a Tree (Hard)
- 3863 - Minimum Operations to Sort a String (Medium)