Tinkoff String Questions
7 string problems asked at Tinkoff interviews
Easy (3)Medium (4)
Questions
| Title | Difficulty |
|---|---|
| Find the Longest Balanced Substring of a Binary String | Easy |
| Decode String | Medium |
| Is Subsequence | Easy |
| Simplify Path | Medium |
| Longest Substring Without Repeating Characters | Medium |
| Longest Palindromic Substring | Medium |
| Valid Palindrome | Easy |
Showing 7 questions