giveinterviewHome / Company interviews / Tinkoff · Updated
Tinkoff interview questions and 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.
Practice interviews built from public job posts and question lists. Each open post links to the original so you can apply on Tinkoff’s own site; Tinkoff does not run, see or review your practice.
Coding questions Tinkoff asks
From public company-tagged interview question lists. Most recent and most frequent first.
- 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 | No |
| Two Sum | Easy | No |
| Form Smallest Number From Two Digit Arrays | Easy | No |
| Minimum Difference Between Highest and Lowest of K Scores | Easy | No |
| Decode String | Medium | No |
| Number of Islands | Medium | No |
| Min Stack | Medium | No |
| Search in Rotated Sorted Array | Medium | No |
| Event Emitter | Medium | No |
| Find the Longest Balanced Substring of a Binary String | Easy | No |
| Is Subsequence | Easy | No |
| Simplify Path | Medium | No |
| Remove Nth Node From End of List | Medium | No |
| Find All Numbers Disappeared in an Array | Easy | No |
| String Compression | Medium | No |
| Battleships in a Board | Medium | No |
| Summary Ranges | Easy | No |
| Roman to Integer | Easy | No |
| Longest Substring Without Repeating Characters | Medium | No |
Questions about Tinkoff interviews
What topics do Tinkoff interviews cover?
The ones that come up most are Array, String, Hash Table, Two Pointers, Stack.
What coding questions does Tinkoff ask?
20 questions are tagged to Tinkoff in public interview lists: 8 easy, 12 medium and 0 hard. The most asked include Longest Palindromic Substring, Find First and Last Position of Element in Sorted Array, Two Sum.
How do I practise a Tinkoff interview?
Answer a 2-minute question for free, then take a mock interview with an AI interviewer, voice and live coding. You get a review that marks the exact line that cost you. The screen and Round 1 of your first role interview are free.
Practise a Tinkoff interview before it counts.
Talk it through while you code, and get a review that marks the exact line that cost you. Free to start.
Interviews at similar companies
- Flipkart1 role · 1 open · 104 questions
- Intuit2 roles · 2 open · 52 questions
- Anduril46 questions
- Google5 roles · 5 open · 1930 questions
- TikTok5 roles · 5 open · 300 questions
- Oracle272 questions
- Apple264 questions
- Goldman Sachs248 questions
- Salesforce168 questions
- Adobe4 roles · 4 open · 137 questions
- Zoho153 questions
- Visa132 questions