Problem database last updated: June 20, 2025

TTinkoff logo

Tinkoff Coding Interview Questions

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

Min Stack

Solve

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

MediumVery Likely
stackdesign

Longest Substring Without Repeating Characters

Solve

Given a string s, find the length of the longest substring without duplicate characters.

MediumVery Likely
hash-tablestringsliding-window

Two Sum

Solve

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

EasyVery Likely
arrayhash-map

Keys and Rooms

Solve

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...

MediumVery Likely
depth-first-searchbreadth-first-searchgraph

Rotate Image

Solve

You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).

MediumVery Likely
arraymathmatrix

Simplify Path

Solve

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...

MediumVery Likely
stringstack

Backspace String Compare

Solve

Given two strings s and t, return true if they are equal when both are typed into empty text editors. '' means a backspace character.

EasyVery Likely
two-pointersstringstack

Longest Palindromic Substring

Solve

Given a string s, return the longest palindromic substring in s.

MediumVery Likely
two-pointersstringdynamic-programming

Find First and Last Position of Element in Sorted Array

Solve

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.

MediumVery Likely
arraybinary-search

Number of Islands

Solve

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

MediumVery Likely
arraydepth-first-searchbreadth-first-search

Search a 2D Matrix

Solve

You are given an m x n integer matrix matrix with the following two properties:

MediumVery Likely
arraybinary-searchmatrix

Battleships in a Board

Solve

Given an m x n matrix board where each cell is a battleship 'X' or empty '.', return the number of the battleships on board.

MediumVery Likely
arraydepth-first-searchmatrix

Form Smallest Number From Two Digit Arrays

Solve

Given two arrays of unique digits nums1 and nums2, return the smallest number that contains at least one digit from each array.

EasyVery Likely
arrayhash-tableenumeration

Find All Numbers Disappeared in an Array

Solve

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

Solve

Given a binary array nums, you should delete one element from it.

MediumVery Likely
arraydynamic-programmingsliding-window

Minimum Difference Between Highest and Lowest of K Scores

Solve

You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k.

EasyLikely
arraysliding-windowsorting

Count Square Submatrices with All Ones

Solve

Given a m n matrix of ones and zeros, return how many square submatrices have all ones.

MediumLikely
arraydynamic-programmingmatrix

Decode String

Solve

Given an encoded string, return its decoded string.

MediumLikely
stringstackrecursion

Search in Rotated Sorted Array

Solve

There is an integer array nums sorted in ascending order (with distinct values).

MediumLikely
arraybinary-search

Is Subsequence

Solve

Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

EasyLikely
two-pointersstringdynamic-programming

Event Emitter

Solve

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...

MediumLikely

Department Highest Salary

Solve

Table: Employee

MediumLikely
database

Maximize Distance to Closest Person

Solve

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...

MediumLikely
array

Reverse Linked List

Solve

Given the head of a singly linked list, reverse the list, and return the reversed list.

EasyLikely
linked-listrecursion

Squares of a Sorted Array

Solve

Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

EasyLikely
arraytwo-pointerssorting

Isomorphic Strings

Solve

Given two strings s and t, determine if they are isomorphic.

EasyLikely
hash-tablestring

Valid Palindrome

Solve

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...

EasyLikely
two-pointersstring

Subarray Sums Divisible by K

Solve

Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k.

MediumLikely
arrayhash-tableprefix-sum

Subarray Sum Equals K

Solve

Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.

MediumLikely
arrayhash-tableprefix-sum

Find the Longest Balanced Substring of a Binary String

Solve

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.

Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.

Frequently Asked Questions

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.

Other companies to explore

Ready to ace your Tinkoff interview?

Simulate a real Tinkoff coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.

Simulate a Tinkoff interview with AIarrow_forward