← Back to Uber

String

37 questions

1Serialize and Deserialize Binary TreeHard
StringTreeDepth-First Search
Solve →
2Split Message Based on LimitHard
StringEnumeration
Solve →
3Serialize and Deserialize Binary TreeHard
StringTreeDepth-First Search
Solve →
4Shortest PalindromeHard
StringRolling HashString Matching
Solve →
5String to Integer (atoi)Medium
String
Solve →
6Regular Expression MatchingHard
StringDynamic ProgrammingRecursion
Solve →
7Valid ParenthesesEasy
StringStack
Solve →
8Longest Valid ParenthesesHard
StringDynamic ProgrammingStack
Solve →
9Decode WaysMedium
StringDynamic Programming
Solve →
10Simplify PathMedium
StringStack
Solve →
11Generate ParenthesesMedium
StringDynamic ProgrammingBacktracking
Solve →
12Longest Palindromic SubsequenceMedium
StringDynamic Programming
Solve →
13Calculate Digit Sum of a StringEasy
StringSimulation
Solve →
14Design Search Autocomplete SystemHard
StringDepth-First SearchDesign
Solve →
15Count Palindromic SubsequencesHard
StringDynamic Programming
Solve →
16Count Different Palindromic SubsequencesHard
StringDynamic Programming
Solve →
17Number of Distinct Substrings in a StringMedium
StringTrieRolling Hash
Solve →
18Repeated String MatchMedium
StringString Matching
Solve →
19Serialize and Deserialize Binary TreeHard
StringTreeDepth-First Search
Solve →
20Split Message Based on LimitHard
StringEnumeration
Solve →
21Decode WaysMedium
StringDynamic Programming
Solve →
22String to Integer (atoi)Medium
String
Solve →
23Regular Expression MatchingHard
StringDynamic ProgrammingRecursion
Solve →
24Generate ParenthesesMedium
StringDynamic ProgrammingBacktracking
Solve →
25Longest Palindromic SubsequenceMedium
StringDynamic Programming
Solve →
26Calculate Digit Sum of a StringEasy
StringSimulation
Solve →
27Longest Valid ParenthesesHard
StringDynamic ProgrammingStack
Solve →
28Shortest PalindromeHard
StringRolling HashString Matching
Solve →
29Valid ParenthesesEasy
StringStack
Solve →
30Design Search Autocomplete SystemHard
StringDepth-First SearchDesign
Solve →
31Simplify PathMedium
StringStack
Solve →
32Freedom TrailHard
StringDynamic ProgrammingDepth-First Search
Solve →
33Count Different Palindromic SubsequencesHard
StringDynamic Programming
Solve →
34Count Palindromic SubsequencesHard
StringDynamic Programming
Solve →
35Number of Distinct Substrings in a StringMedium
StringTrieRolling Hash
Solve →
36Repeated String MatchMedium
StringString Matching
Solve →
37Goat LatinEasy
String
Solve →