DSA Doctor
Verified Company Vault
30d Active
Yandex DSA Interview Questions
129 curated coding interview questions directly asked in Yandex technical rounds, sorted by frequency with recency and difficulty diagnostics.
129
Total Questions
52 (40%)
Easy Problems
68 (53%)
Medium Problems
9 (7%)
Hard Problems
🔥 Most Tested Topics:
Arrays (42)Core DSA (35)Strings (24)Trees (19)Linked List (7)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 100.0% | 30d |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium | Arrays | Sorting / Prefix / Scan | 71.2% | 87.5% | 30d |
| 849 | Maximize Distance to Closest Person | Medium | Core DSA | Implementation / Reasoning | 49.8% | 87.5% | 3m |
| 228 | Summary Ranges | Easy | Arrays | Sorting / Prefix / Scan | 54.2% | 87.5% | 3m |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 87.5% | 3m |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 75.0% | 3m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | 3m |
| 680 | Valid Palindrome II | Easy | Strings | Hashing / Sliding Window | 44.3% | 75.0% | 3m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | 3m |
| 986 | Interval List Intersections | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 73.0% | 75.0% | 3m |
| 161 | One Edit Distance | Medium | Dynamic Programming | State Transition | 34.6% | 75.0% | all |
| 205 | Isomorphic Strings | Easy | Strings | Hashing / Sliding Window | 48.4% | 75.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 75.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 75.0% | all |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium | Arrays | Sorting / Prefix / Scan | 88.3% | 75.0% | all |
| 356 | Line Reflection | Medium | Core DSA | Implementation / Reasoning | 36.3% | 62.5% | 6m |
| 438 | Find All Anagrams in a String | Medium | Strings | Hashing / Sliding Window | 53.8% | 62.5% | 6m |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 62.5% | 6m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | 6m |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | Arrays | Sorting / Prefix / Scan | 64.9% | 62.5% | 6m |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 62.5% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | 6m |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 62.5% | 6m |
| 652 | Find Duplicate Subtrees | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 60.7% | 62.5% | 6m |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 50.0% | 62.5% | 6m |
| 2629 | Function Composition | Easy | Core DSA | Implementation / Reasoning | 86.8% | 62.5% | 6m |
| 567 | Permutation in String | Medium | Strings; Backtracking | Hashing / Sliding Window; Sliding Window; Backtracking | 48.9% | 62.5% | 6m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | 6m |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | 6m |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | 6m |
| 279 | Perfect Squares | Medium | Core DSA | Implementation / Reasoning | 56.5% | 62.5% | 6m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 62.5% | 6m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 62.5% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 62.5% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 62.5% | all |
| 2241 | Design an ATM Machine | Medium | Design | Data Structure Design | 45.1% | 62.5% | all |
| 392 | Is Subsequence | Easy | Core DSA | Implementation / Reasoning | 49.0% | 62.5% | all |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 62.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 50.0% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 50.0% | all |
| 101 | Symmetric Tree | Easy | Trees | DFS / BFS | 61.2% | 50.0% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 50.0% | all |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 50.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 50.0% | all |
| 199 | Binary Tree Right Side View | Medium | Trees | DFS / BFS | 70.2% | 50.0% | all |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 50.0% | all |
| 362 | Design Hit Counter | Medium | Design | Data Structure Design | 69.7% | 50.0% | all |
| 933 | Number of Recent Calls | Easy | Core DSA | Implementation / Reasoning | 78.5% | 50.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | all |
| 2743 | Count Substrings Without Repeating Character | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 75.9% | 50.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 37.5% | all |
| 27 | Remove Element | Easy | Core DSA | Implementation / Reasoning | 61.8% | 37.5% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 37.5% | all |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 37.5% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 37.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 37.5% | all |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 54.7% | 37.5% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 37.5% | all |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 70.6% | 37.5% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 37.5% | all |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 37.5% | all |
| 350 | Intersection of Two Arrays II | Easy | Arrays | Sorting / Prefix / Scan | 59.9% | 37.5% | all |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 37.5% | all |
| 485 | Max Consecutive Ones | Easy | Core DSA | Implementation / Reasoning | 65.2% | 37.5% | all |
| 523 | Continuous Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 31.4% | 37.5% | all |
| 1436 | Destination City | Easy | Core DSA | Implementation / Reasoning | 79.5% | 37.5% | all |
| 605 | Can Place Flowers | Easy | Core DSA | Implementation / Reasoning | 29.1% | 37.5% | all |
| 896 | Monotonic Array | Easy | Arrays | Sorting / Prefix / Scan | 62.3% | 37.5% | all |
| 1868 | Product of Two Run-Length Encoded Arrays | Medium | Arrays | Sorting / Prefix / Scan | 59.6% | 37.5% | all |
| 674 | Longest Continuous Increasing Subsequence | Easy | Core DSA | Implementation / Reasoning | 52.1% | 37.5% | all |
| 938 | Range Sum of BST | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 87.6% | 37.5% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 37.5% | all |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 37.5% | all |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 37.5% | all |
| 232 | Implement Queue using Stacks | Easy | Stack / Queue | Monotonic Stack / Simulation | 69.8% | 37.5% | all |
| 1656 | Design an Ordered Stream | Easy | Design | Data Structure Design | 82.7% | 37.5% | all |
| 19 | Remove Nth Node From End of List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 51.6% | 37.5% | all |
| 102 | Binary Tree Level Order Traversal | Medium | Trees | DFS / BFS | 72.7% | 37.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 37.5% | all |
| 415 | Add Strings | Easy | Strings | Hashing / Sliding Window | 52.2% | 37.5% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 37.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 37.5% | all |
| 2666 | Allow One Function Call | Easy | Core DSA | Implementation / Reasoning | 86.6% | 37.5% | all |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 25.0% | all |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 25.0% | all |
| 167 | Two Sum II - Input Array Is Sorted | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 65.1% | 25.0% | all |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 25.0% | all |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 25.0% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 25.0% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 25.0% | all |
| 395 | Longest Substring with At Least K Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 46.3% | 25.0% | all |
| 771 | Jewels and Stones | Easy | Core DSA | Implementation / Reasoning | 89.6% | 25.0% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 25.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 25.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 25.0% | all |
| 2570 | Merge Two 2D Arrays by Summing Values | Easy | Arrays | Sorting / Prefix / Scan | 81.7% | 25.0% | all |
| 470 | Implement Rand10() Using Rand7() | Medium | Core DSA | Implementation / Reasoning | 46.4% | 25.0% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 25.0% | all |
| 24 | Swap Nodes in Pairs | Medium | Trees | DFS / BFS | 69.5% | 25.0% | all |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | Trees | DFS / BFS | 83.0% | 25.0% | all |
| 2667 | Create Hello World Function | Easy | Core DSA | Implementation / Reasoning | 81.9% | 25.0% | all |
| 1572 | Matrix Diagonal Sum | Easy | Arrays | Sorting / Prefix / Scan | 84.3% | 25.0% | all |
| 1386 | Cinema Seat Allocation | Medium | Core DSA | Implementation / Reasoning | 44.6% | 25.0% | all |
| 2665 | Counter II | Easy | Core DSA | Implementation / Reasoning | 81.2% | 25.0% | all |
| 35 | Search Insert Position | Easy | Binary Search | Binary Search | 51.3% | 25.0% | all |
| 1496 | Path Crossing | Easy | Core DSA | Implementation / Reasoning | 62.6% | 25.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 25.0% | all |
| 181 | Employees Earning More Than Their Managers | Easy | Core DSA | Implementation / Reasoning | 73.2% | 25.0% | all |
| 643 | Maximum Average Subarray I | Easy | Arrays | Sorting / Prefix / Scan | 47.8% | 25.0% | all |
| 2215 | Find the Difference of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 81.4% | 25.0% | all |
| 2956 | Find Common Elements Between Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 84.5% | 25.0% | all |
| 974 | Subarray Sums Divisible by K | Medium | Arrays | Sorting / Prefix / Scan | 56.3% | 25.0% | all |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 25.0% | all |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 25.0% | all |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 25.0% | all |
| 150 | Evaluate Reverse Polish Notation | Medium | Core DSA | Implementation / Reasoning | 57.8% | 25.0% | all |
| 1464 | Maximum Product of Two Elements in an Array | Easy | Arrays | Sorting / Prefix / Scan | 83.6% | 25.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 25.0% | all |
| 281 | Zigzag Iterator | Medium | Design | Data Structure Design | 67.0% | 25.0% | all |
| 704 | Binary Search | Easy | Binary Search | Binary Search | 60.9% | 25.0% | all |
| 1229 | Meeting Scheduler | Medium | Greedy | Greedy | 55.2% | 25.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 25.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 25.0% | all |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 25.0% | all |