30 problems · 11 Easy, 19 Medium, 0 Hard · Ranked #65 of 458
Difficulty breakdown
11 Easy
37% · avg 23%
19 Medium
63% · avg 59%
0 Hard
0% · avg 18%
Top topics
array
53.3%
string
30%
hash-table
20%
matrix
16.7%1.9x
two-pointers
16.7%
stack
13.3%1.5x
Interview profile
Based on 30 reported problems, Tinkoff interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (63%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Tinkoff puts unusual emphasis on sliding-window (10% of problems, 2.1x the industry average), prefix-sum (6.7% of problems, 2x the industry average), matrix (16.7% of problems, 1.9x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (53.3%), string (30%), hash-table (20%), matrix (16.7%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 30 problems
Problem
Difficulty
Frequency
Topics
Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
There are n rooms labeled from 0 to n - 1 and all the rooms are locked except for room 0. Your goal is to visit all the rooms. However, you cannot enter a locke...
You are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif...
Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.
Design an EventEmitter class. This interface is similar (but with some differences) to the one found in Node.js or the Event Target interface of the DOM. The Ev...
You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat...
A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa...
There are n rooms labeled from 0 to n - 1 and all the rooms are locked except for room 0. Your goal is to visit all the rooms. However, you cannot enter a locke...
You are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif...
Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.
EasyVery Likely
arrayhash-table
Longest Subarray of 1's After Deleting One Element
Design an EventEmitter class. This interface is similar (but with some differences) to the one found in Node.js or the Event Target interface of the DOM. The Ev...
You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat...
A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa...
You are given a binary string s consisting only of zeroes and ones.
EasyLikely
string
How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Tinkoff interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Preparing for your Tinkoff coding interview
Tinkoff interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Tinkoff interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
What coding problems does Tinkoff ask in interviews?add
Tinkoff has been reported to ask 30 distinct coding problems. The most common topics are array, string, hash-table. 11 are Easy difficulty, 19 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Tinkoff coding interviews?add
Based on 30 reported problems, Tinkoff interviews are easier than average - only 0% Hard compared to 18% across all companies. 63% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Tinkoff coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Tinkoff coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.