Yandex Coding Interview Questions
We track 122 coding questions asked at Yandex, tagged with the algorithms and concepts they test. The most common: Array, Hash Table, String, Two Pointers, Sorting.
Browse all 122 Yandex questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array22.5%
- Hash Table9.2%
- String8.5%
- Two Pointers7.1%
- Math4.1%
- Binary Search3.9%
- Sorting3.2%
- Sliding Window3.2%
- Dynamic Programming3.2%
- Linked List3.0%
- Other (34)32.0%
How many questions involve each concept
Share of all 122 tracked Yandex questions that touch each concept. Questions usually involve several, so these overlap.
- Array51.6%
- Hash Table27.0%
- String22.1%
- Two Pointers19.7%
- Sorting11.5%
- Binary Search10.7%
- Sliding Window10.7%
- Dynamic Programming9.0%
- Math9.0%
- Binary Tree8.2%
- Depth-First Search8.2%
- Tree8.2%
Where Yandex differs from the average company
Concept weight at Yandex relative to the average across all companies we track. Green means Yandex leans on it harder than most.
- Data Stream7.0×
- Randomized4.0×
- Monotonic Queue3.0×
- Queue2.8×
- Greedy0.50×
- Counting0.50×
- Backtracking0.46×
- Simulation0.35×
Yandex specialties
Concepts that show up at Yandex but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 122 tracked Yandex questions.
- Junior43% (52)
- Mid/Senior50% (61)
- Staff7% (9)
Every concept in Yandex interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 63 | 51.6% | 22.5% |
| Hash Table | 33 | 27.0% | 9.2% |
| String | 27 | 22.1% | 8.5% |
| Two Pointers | 24 | 19.7% | 7.1% |
| Sorting | 14 | 11.5% | 3.2% |
| Binary Search | 13 | 10.7% | 3.9% |
| Sliding Window | 13 | 10.7% | 3.2% |
| Dynamic Programming | 11 | 9.0% | 3.2% |
| Math | 11 | 9.0% | 4.1% |
| Binary Tree | 10 | 8.2% | 2.4% |
| Depth-First Search | 10 | 8.2% | 2.1% |
| Tree | 10 | 8.2% | 2.4% |
| Linked List | 9 | 7.4% | 3.0% |
| Stack | 9 | 7.4% | 2.9% |
| Breadth-First Search | 8 | 6.6% | 2.1% |
| Design | 8 | 6.6% | 2.1% |
| Heap (Priority Queue) | 8 | 6.6% | 1.4% |
| Divide and Conquer | 6 | 4.9% | 1.3% |
| Prefix Sum | 6 | 4.9% | 1.7% |
| Greedy | 5 | 4.1% | 1.5% |
| Queue | 5 | 4.1% | 1.1% |
| Recursion | 5 | 4.1% | 1.8% |
| Matrix | 4 | 3.3% | 1.2% |
| Binary Search Tree | 3 | 2.5% | 0.7% |
| Bit Manipulation | 3 | 2.5% | 1.0% |
| Counting | 3 | 2.5% | 0.5% |
| Data Stream | 3 | 2.5% | 0.7% |
| Backtracking | 2 | 1.6% | 0.6% |
| Monotonic Queue | 2 | 1.6% | 0.3% |
| Monotonic Stack | 2 | 1.6% | 0.5% |
| Randomized | 2 | 1.6% | 0.4% |
| Simulation | 2 | 1.6% | 0.6% |
| Bucket Sort | 1 | 0.8% | 0.1% |
| Database | 1 | 0.8% | 0.9% |
| Doubly-Linked List | 1 | 0.8% | 0.2% |
| Eulerian Circuit | 1 | 0.8% | 0.1% |
| Graph Theory | 1 | 0.8% | 0.1% |
| Sweep Line | 1 | 0.8% | 0.3% |
| Merge Sort | 1 | 0.8% | 0.2% |
| Ordered Set | 1 | 0.8% | 0.1% |
| Probability and Statistics | 1 | 0.8% | 0.2% |
| Quickselect | 1 | 0.8% | 0.1% |
| Rejection Sampling | 1 | 0.8% | 0.2% |
| Union-Find | 1 | 0.8% | 0.2% |
Practice a Yandex interview
Take a realistic AI-led mock interview with questions Yandex actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required