Tinkoff Interview Questions — 32 DSA Problems
30 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Tinkoff LeetCode questions for software engineering interviews.
- Min Stack (MEDIUM) — Stack, Design
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Two Sum (EASY) — Array, Hash Table
- Rotate Image (MEDIUM) — Array, Math, Matrix
- Keys and Rooms (MEDIUM) — Depth-First Search, Breadth-First Search, Graph
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
- Find First and Last Position of Element in Sorted Array (MEDIUM) — Array, Binary Search
- Simplify Path (MEDIUM) — String, Stack
- Backspace String Compare (EASY) — Two Pointers, String, Stack, Simulation
- Form Smallest Number From Two Digit Arrays (EASY) — Array, Hash Table, Enumeration
- Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
- Battleships in a Board (MEDIUM) — Array, Depth-First Search, Matrix
- Find All Numbers Disappeared in an Array (EASY) — Array, Hash Table
- Longest Subarray of 1's After Deleting One Element (MEDIUM) — Array, Dynamic Programming, Sliding Window
- Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix
- Is Subsequence (EASY) — Two Pointers, String, Dynamic Programming
- Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
- Minimum Difference Between Highest and Lowest of K Scores (EASY) — Array, Sliding Window, Sorting
- Count Square Submatrices with All Ones (MEDIUM) — Array, Dynamic Programming, Matrix
- Decode String (MEDIUM) — String, Stack, Recursion
- Event Emitter (MEDIUM) —
- Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
- Squares of a Sorted Array (EASY) — Array, Two Pointers, Sorting
- Subarray Sums Divisible by K (MEDIUM) — Array, Hash Table, Prefix Sum
- Maximize Distance to Closest Person (MEDIUM) — Array
- Department Highest Salary (MEDIUM) — Database
- Isomorphic Strings (EASY) — Hash Table, String
- Subarray Sum Equals K (MEDIUM) — Array, Hash Table, Prefix Sum
- Paint House (MEDIUM) — Array, Dynamic Programming
- Valid Palindrome (EASY) — Two Pointers, String
- Find the Longest Balanced Substring of a Binary String (EASY) — String
- Reverse Linked List (EASY) — Linked List, Recursion
T
Tinkoff
32 questions tracked30 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 32 of 32 questions
2Hash TableStringSliding Window
5Depth-First SearchBreadth-First SearchGraph
6Two PointersStringDynamic Programming
7MediumFind First and Last Position of Element in Sorted Array✓ Our Solution ArrayBinary Search
9Two PointersStringStackSimulation
10ArrayHash TableEnumeration
11ArrayDepth-First SearchBreadth-First SearchUnion Find+1
12ArrayDepth-First SearchMatrix
14MediumLongest Subarray of 1's After Deleting One Element✓ Our Solution ArrayDynamic ProgrammingSliding Window
16Two PointersStringDynamic Programming
18EasyMinimum Difference Between Highest and Lowest of K Scores✓ Our Solution ArraySliding WindowSorting
19ArrayDynamic ProgrammingMatrix
22MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
24ArrayHash TablePrefix Sum
28ArrayHash TablePrefix Sum
29MediumPaint House
ArrayDynamic Programming
31EasyFind the Longest Balanced Substring of a Binary String✓ Our Solution String