Tinkoff Dynamic Programming Questions
2 dynamic programming problems asked at Tinkoff interviews
Easy (1)Medium (1)
Questions
| Title | Difficulty |
|---|---|
| Is Subsequence | Easy |
| Longest Palindromic Substring | Medium |
Showing 2 questions
2 dynamic programming problems asked at Tinkoff interviews
| Title | Difficulty |
|---|---|
| Is Subsequence | Easy |
| Longest Palindromic Substring | Medium |
Showing 2 questions