Yandex interview questions¶
The most frequent LeetCode problems tagged to Yandex. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 29 distinct problems tagged to Yandex in the last 6 months (4 in the last 30 days, 14 in the last 3 months, 128 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Difficulty mix (last 6 months): Medium 66%, Easy 31%, Hard 3%
Most tagged topics (share of problems): Array 62%, Hash Table 31%, Two Pointers 24%, Sliding Window 21%, String 21%, Math 17%, Depth-First Search 14%, Breadth-First Search 14%, Dynamic Programming 10%, Sorting 10%
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Longest Subarray of 1's After Deleting One Element | Medium | 30 days | Array, Dynamic Programming, Sliding Window |
| 2 | Summary Ranges | Easy | 30 days | Array |
| 3 | String Compression | Medium | 30 days | Two Pointers, String |
| 4 | Valid Palindrome II | Easy | 30 days | Two Pointers, String, Greedy |
| 5 | Maximize Distance to Closest Person | Medium | 3 months | Array |
| 6 | Merge Intervals | Medium | 3 months | Array, Sorting, Quicksort |
| 7 | Subarray Sum Equals K | Medium | 3 months | Array, Hash Table, Prefix Sum |
| 8 | Longest Palindromic Substring | Medium | 3 months | Two Pointers, String, Dynamic Programming, Manacher |
| 9 | Interval List Intersections | Medium | 3 months | Array, Two Pointers, Sweep Line |
| 10 | Number of Islands | Medium | 3 months | Array, Depth-First Search, Breadth-First Search, Union-Find |
| 11 | Binary Tree Right Side View | Medium | 3 months | Tree, Depth-First Search, Breadth-First Search, Binary Tree |
| 12 | Symmetric Tree | Easy | 3 months | Tree, Depth-First Search, Breadth-First Search, Binary Tree |
| 13 | Palindrome Number | Easy | 3 months | Math |
| 14 | First Unique Character in a String | Easy | 3 months | Hash Table, String, Queue, Counting |
| 15 | Find K Closest Elements | Medium | 6 months | Array, Two Pointers, Binary Search, Sliding Window |
| 16 | Longest Substring Without Repeating Characters | Medium | 6 months | Hash Table, String, Sliding Window |
| 17 | Line Reflection | Medium | 6 months | Array, Hash Table, Math |
| 18 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | 6 months | Array |
| 19 | Two Sum | Easy | 6 months | Array, Hash Table |
| 20 | Insert Delete GetRandom O(1) | Medium | 6 months | Array, Hash Table, Math, Design |
| 21 | Find Duplicate Subtrees | Medium | 6 months | Hash Table, Tree, Depth-First Search, Binary Tree |
| 22 | Squares of a Sorted Array | Easy | 6 months | Array, Two Pointers, Sorting |
| 23 | Search in Rotated Sorted Array | Medium | 6 months | Array, Binary Search |
| 24 | Max Consecutive Ones III | Medium | 6 months | Array, Binary Search, Sliding Window, Prefix Sum |
| 25 | Longest Substring with At Most K Distinct Characters | Medium | 6 months | Hash Table, String, Sliding Window |
| 26 | Perfect Squares | Medium | 6 months | Math, Dynamic Programming, Breadth-First Search, Knapsack Problem |
| 27 | Remove Duplicates from Sorted Array | Easy | 6 months | Array, Two Pointers |
| 28 | Evaluate Reverse Polish Notation | Medium | 6 months | Array, Math, Stack |
| 29 | Subarrays with K Different Integers | Hard | 6 months | Array, Hash Table, Sliding Window, Counting |
Signature problems¶
Problems where Yandex accounts for a large share of all recent tags across companies. These are the most Yandex-specific questions in the data.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Longest Subarray of 1's After Deleting One Element | Medium | 30 days | Array, Dynamic Programming, Sliding Window |
| 2 | Summary Ranges | Easy | 30 days | Array |
| 3 | Valid Palindrome II | Easy | 30 days | Two Pointers, String, Greedy |
| 4 | Maximize Distance to Closest Person | Medium | 3 months | Array |
| 5 | Interval List Intersections | Medium | 3 months | Array, Two Pointers, Sweep Line |
| 6 | Line Reflection | Medium | 6 months | Array, Hash Table, Math |
| 7 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | 6 months | Array |
| 8 | Find Duplicate Subtrees | Medium | 6 months | Hash Table, Tree, Depth-First Search, Binary Tree |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies