DSA Doctor
Verified Company Vault
Tinkoff DSA Interview Questions
18 curated coding interview questions directly asked in Tinkoff technical rounds, sorted by frequency with recency and difficulty diagnostics.
18
Total Questions
7 (39%)
Easy Problems
11 (61%)
Medium Problems
0 (0%)
Hard Problems
🔥 Most Tested Topics:
Arrays (6)Strings (5)Trees (4)Core DSA (3)Stack / Queue (2)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 100.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 100.0% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 87.5% | all |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 87.5% | all |
| 392 | Is Subsequence | Easy | Core DSA | Implementation / Reasoning | 49.0% | 87.5% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 87.5% | all |
| 2694 | Event Emitter | Medium | Core DSA | Implementation / Reasoning | 75.1% | 87.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 87.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 87.5% | all |
| 2605 | Form Smallest Number From Two Digit Arrays | Easy | Arrays | Sorting / Prefix / Scan | 55.2% | 87.5% | all |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | Arrays | Sorting / Prefix / Scan | 66.3% | 87.5% | all |
| 2609 | Find the Longest Balanced Substring of a Binary String | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 46.5% | 87.5% | all |
| 19 | Remove Nth Node From End of List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 51.6% | 87.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 75.0% | all |
| 419 | Battleships in a Board | Medium | Binary Search | Binary Search | 77.5% | 75.0% | all |
| 448 | Find All Numbers Disappeared in an Array | Easy | Arrays | Sorting / Prefix / Scan | 64.1% | 75.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 75.0% | all |