Tinkoff LeetCode interview questions

Explore Tinkoff questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 19

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Find First and Last Position of Element in Sorted Array Array Binary Search MEDIUM	Medium	100.0%	0.5%
Longest Palindromic Substring Two Pointers String Dynamic Programming +1 MEDIUM	Medium	94.0%	0.4%
Search in Rotated Sorted Array Array Binary Search MEDIUM	Medium	94.0%	0.5%
Two Sum Array Hash Table EASY	Easy	86.3%	0.6%
Simplify Path String Stack MEDIUM	Medium	86.3%	0.5%
Is Subsequence Two Pointers String Dynamic Programming EASY	Easy	86.3%	0.5%
Decode String String Stack Recursion MEDIUM	Medium	86.3%	0.6%
Find the Longest Balanced Substring of a Binary String String EASY	Easy	86.3%	0.5%
Longest Substring Without Repeating Characters Hash Table String Sliding Window MEDIUM	Medium	75.4%	0.4%
Min Stack Stack Design MEDIUM	Medium	75.4%	0.6%
Battleships in a Board Array Depth-First Search Matrix MEDIUM	Medium	75.4%	0.8%
Event Emitter MEDIUM	Medium	75.4%	0.8%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	75.4%	0.7%
Minimum Difference Between Highest and Lowest of K Scores Array Sliding Window Sorting EASY	Easy	75.4%	0.7%
Remove Nth Node From End of List Linked List Two Pointers MEDIUM	Medium	75.4%	0.5%
Summary Ranges Array EASY	Easy	75.4%	0.5%
Roman to Integer Hash Table Math String EASY	Easy	75.4%	0.7%
String Compression Two Pointers String MEDIUM	Medium	75.4%	0.6%
Line Reflection Array Hash Table Math MEDIUM	Medium	75.4%	0.4%

Showing 1–19 of 19 matching problems · All Problems

Tinkoff LeetCode Interview Questions | Grind Practice