Tinkoff coding interview
questions, leaked.
32 problems reported across recent Tinkoff interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Tinkoff's assessment is 65% medium difficulty, 35% easy. No hard problems, which means they're testing pattern recognition and clean implementation over gotchas. You've got 32 problems in their report. Arrays dominate the list (18 problems), followed by strings (9) and hash tables (7). If you nail array manipulation, two-pointer work, and hash-table lookups, you'll recognize most of what they throw at you. The weak spot for most candidates is the transition from medium to their medium: problems like Longest Substring Without Repeating Characters or Rotate Image require you to hold multiple constraints at once. StealthCoder sits invisible during your OA and surfaces working solutions the moment you hit a wall, so you can keep moving.
Top problems at Tinkoff
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Substring Without Repeating Characters | MEDIUM | 100.0 | 37% | Hash Table · String · Sliding Window |
| 02 | Min Stack | MEDIUM | 100.0 | 56% | Stack · Design |
| 03 | Two Sum | EASY | 97.6 | 56% | Array · Hash Table |
| 04 | Keys and Rooms | MEDIUM | 85.0 | 75% | Depth-First Search · Breadth-First Search · Graph |
| 05 | Rotate Image | MEDIUM | 85.0 | 78% | Array · Math · Matrix |
| 06 | Longest Palindromic Substring | MEDIUM | 80.5 | 36% | Two Pointers · String · Dynamic Programming |
| 07 | Simplify Path | MEDIUM | 80.5 | 48% | String · Stack |
| 08 | Backspace String Compare | EASY | 80.5 | 49% | Two Pointers · String · Stack |
| 09 | Find First and Last Position of Element in Sorted Array | MEDIUM | 80.5 | 47% | Array · Binary Search |
| 10 | Find All Numbers Disappeared in an Array | EASY | 75.0 | 62% | Array · Hash Table |
| 11 | Search a 2D Matrix | MEDIUM | 75.0 | 52% | Array · Binary Search · Matrix |
| 12 | Form Smallest Number From Two Digit Arrays | EASY | 75.0 | 54% | Array · Hash Table · Enumeration |
| 13 | Number of Islands | MEDIUM | 75.0 | 62% | Array · Depth-First Search · Breadth-First Search |
| 14 | Longest Subarray of 1's After Deleting One Element | MEDIUM | 75.0 | 69% | Array · Dynamic Programming · Sliding Window |
| 15 | Battleships in a Board | MEDIUM | 75.0 | 77% | Array · Depth-First Search · Matrix |
| 16 | Decode String | MEDIUM | 67.9 | 61% | String · Stack · Recursion |
| 17 | Event Emitter | MEDIUM | 67.9 | 74% | |
| 18 | Count Square Submatrices with All Ones | MEDIUM | 67.9 | 79% | Array · Dynamic Programming · Matrix |
| 19 | Search in Rotated Sorted Array | MEDIUM | 67.9 | 43% | Array · Binary Search |
| 20 | Is Subsequence | EASY | 67.9 | 48% | Two Pointers · String · Dynamic Programming |
| 21 | Minimum Difference Between Highest and Lowest of K Scores | EASY | 67.9 | 59% | Array · Sliding Window · Sorting |
| 22 | Department Highest Salary | MEDIUM | 57.9 | 55% | Database |
| 23 | Paint House | MEDIUM | 57.9 | 64% | Array · Dynamic Programming |
| 24 | Squares of a Sorted Array | EASY | 57.9 | 73% | Array · Two Pointers · Sorting |
| 25 | Meeting Rooms II | MEDIUM | 57.9 | 52% | Array · Two Pointers · Greedy |
| 26 | Valid Palindrome | EASY | 57.9 | 51% | Two Pointers · String |
| 27 | Subarray Sum Equals K | MEDIUM | 57.9 | 45% | Array · Hash Table · Prefix Sum |
| 28 | Subarray Sums Divisible by K | MEDIUM | 57.9 | 56% | Array · Hash Table · Prefix Sum |
| 29 | Maximize Distance to Closest Person | MEDIUM | 57.9 | 49% | Array |
| 30 | Isomorphic Strings | EASY | 57.9 | 47% | Hash Table · String |
| 31 | Find the Longest Balanced Substring of a Binary String | EASY | 57.9 | 45% | String |
| 32 | Reverse Linked List | EASY | 57.9 | 79% | Linked List · Recursion |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Tinkoff OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share.
Get StealthCoder- array18 · 56%
- string9 · 28%
- hash table7 · 22%
- two pointers6 · 19%
- matrix5 · 16%
- dynamic programming5 · 16%
- stack4 · 13%
- sliding window3 · 9%
- depth first search3 · 9%
- binary search3 · 9%
The topic distribution tells you Tinkoff cares about fluency with sequential and spatial data. Arrays appear in 56% of the problems (18 out of 32), often paired with hash tables or two pointers. String problems (9 total) almost always involve sliding windows or hash tables to track character state. Matrix and grid traversal (5 problems) test your comfort with nested loops and coordinate math. Dynamic programming shows up in only 5 problems, so don't burn a week on DP edge cases. Two-pointers is foundational (6 problems) and intersects heavily with arrays and strings. The medium skew means speed matters: you need to code Rotate Image or Longest Palindromic Substring in under 15 minutes. Practice array problems first, then string manipulation with hash tables. When the OA is live and you're stuck on a sliding-window variant, StealthCoder runs invisibly and gives you the pattern in seconds.
Companies with similar patterns
If you prepped for Tinkoff, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Tinkoff.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Tinkoff interview FAQ
Should I drill dynamic programming before the assessment?+
No. DP appears in only 5 of 32 problems. Focus on arrays (18), strings (9), and hash tables (7) first. DP is a hedge, not the core. Save it for the final 2-3 days if you have time and confidence with the fundamentals.
How many array problems do I need to solve to be safe?+
Arrays are 56% of the assessment (18 problems). Solve at least 15 to 20 distinct array problems, mixing easy and medium. Hit Two Sum, Rotate Image, Find First and Last Position, and Search a 2D Matrix specifically. That covers the patterns they use most.
Is two-pointers enough to handle their string problems?+
Partially. String problems here pair two-pointers with hash tables and sliding windows (see Longest Substring Without Repeating Characters, Backspace String Compare). Don't study two-pointers in isolation. Practice strings with hash-table state tracking alongside it.
What should I study first if I have 5 days?+
Day 1-2: array fundamentals and hash-table lookups (Two Sum, rotate, search patterns). Day 3: strings with sliding windows and hash tables. Day 4: stack and DFS (Min Stack, Keys and Rooms). Day 5: matrix and edge cases. No hard problems means execution speed beats depth.
How much time should I spend on matrix problems?+
Matrix appears in 5 problems but almost always paired with arrays or search. Spend 2-3 hours on Rotate Image and Search a 2D Matrix, then move on. They're not the bottleneck here. Arrays are.