Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Practice Problems

Daily Challenge: Fewest Hops (1300) Solve it to start a streak

strings Problems

103 practice problems tagged strings , from difficulty 800 to 2400 — solve them in our in-browser judge with instant verdicts. Browse all problems.

Related: implementation dp suffix-array math stack two-pointers sorting prefix-sums manacher kmp

ProblemTopics Solvers Acceptance Difficulty
Shout It implementation strings 5
100%
800
Swap the Case implementation strings 5
100%
800
Strip the Vowels strings 5
100%
800
Alternating Caps strings 4
100%
800
Build the Acronym strings 5
71%
800
Count a Given Character strings 41
87%
800
Letters versus Digits strings 5
100%
800
Vowels and Consonants strings 3
100%
800
Isogram Check strings 5
100%
800
The Longest Word strings 3
100%
800
Count the Transitions strings 4
100%
800
ROT13 strings 14
75%
800
Atbash Mirror strings 2
100%
800
Cut and Dot strings 1
100%
800
Pairwise Swap strings 1
50%
800
Words Containing C strings 1
100%
800
Reverse a String implementation strings 2
100%
900
Capitalize Every Word strings 1
100%
900
Keep First Occurrences strings 0 — 900
Reverse the Word Order strings 0 — 900
Mirror Each Word strings 0 — 900
Caesar Shift strings 0 — 900
Longest Run of One Letter strings 0 — 900
Most Common Letter strings 0 — 900
Anagram Check strings 0 — 900
Pangram Check strings 0 — 900
Sort the Words strings sorting 0 — 900
Unique Word Count strings 0 — 900
Longest Block of Ones strings 0 — 900
Longest Zero Gap strings 0 — 900
Slippery Keyboard strings 0 — 900
Valid Hexadecimal implementation strings 0 — 900
Valid Clock Time implementation strings 0 — 900
snake_case to camelCase strings 0 — 900
camelCase to snake_case strings 0 — 900
Grouped with Dashes strings 0 — 900
Tidy the Spaces strings 0 — 900
How Many Blocks strings 0 — 900
The Repeating Banner math strings 0 — 900
Count the Vowels strings 2
100%
1000
Balanced Brackets implementation strings 0 — 1000
Run-Length Encoding strings 0 — 1000
Run-Length Decoding strings 0 — 1000
Rotate Left by K strings 0 — 1000
First Unique Character strings 0 — 1000
Most Frequent Word strings 0 — 1000
Word Chain strings 0 — 1000
Shortest Words First strings sorting 0 — 1000
Valid Integer implementation strings 0 — 1000
Strong Enough Password implementation strings 0 — 1000