Company interviews / Tinkoff
Tinkoff interview practice
20 coding questions are known to come up in Tinkoff interviews (8 easy, 12 medium, 0 hard), 1 of them in the last six months. The most common topics are Array, String, Hash Table, Two Pointers.
20Known questions
1Asked in last 6 months
12Medium
0Hard
Coding questions Tinkoff asks
From public company-tagged interview question lists. Most recent and most frequent first.
Easy 8Medium 12Hard 0
- Array9
- String8
- Hash Table5
- Two Pointers4
- Stack3
- Dynamic Programming2
- Binary Search2
- Sliding Window2
- Depth-First Search2
- Matrix2
- Enumeration1
- Sorting1
| Question | Difficulty | Asked recently |
|---|---|---|
| Longest Palindromic Substring | Medium | Yes |
| Find First and Last Position of Element in Sorted Array | Medium | — |
| Two Sum | Easy | — |
| Form Smallest Number From Two Digit Arrays | Easy | — |
| Minimum Difference Between Highest and Lowest of K Scores | Easy | — |
| Decode String | Medium | — |
| Number of Islands | Medium | — |
| Min Stack | Medium | — |
| Search in Rotated Sorted Array | Medium | — |
| Event Emitter | Medium | — |
| Find the Longest Balanced Substring of a Binary String | Easy | — |
| Is Subsequence | Easy | — |
| Simplify Path | Medium | — |
| Remove Nth Node From End of List | Medium | — |
| Find All Numbers Disappeared in an Array | Easy | — |
| String Compression | Medium | — |
| Battleships in a Board | Medium | — |
| Summary Ranges | Easy | — |
| Roman to Integer | Easy | — |
| Longest Substring Without Repeating Characters | Medium | — |
Practice a Tinkoff interview
Take the same AI interview a Tinkoff candidate would face: you talk it through while you code, and get a scorecard with what earned each score. Three single-question interviews a day are free.