Yandex LeetCode Interview Questions
Practice 131 coding problems currently tagged to Yandex. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
Top Topics at Yandex
Ace your Yandex interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Yandex LeetCode Interview Questions
| Problem | DifficultyDiff | Action |
|---|---|---|
Longest Subarray of 1's After Deleting One Element 100% | MediumM | Solve→ |
Maximize Distance to Closest Person 91.5% | MediumM | Solve→ |
Summary Ranges 89.4% | EasyE | Solve→ |
83% | MediumM | Solve→ |
Find K Closest Elements 82.5% | MediumM | Solve→ |
80.9% | MediumM | Solve→ |
Valid Palindrome II 80.3% | EasyE | Solve→ |
78.5% | MediumM | Solve→ |
77.8% | MediumM | Solve→ |
73.4% | EasyE | Solve→ |
Isomorphic Strings 71.6% | EasyE | Solve→ |
70.7% | EasyE | Solve→ |
One Edit Distance 70.7% | MediumM | Solve→ |
Line Reflection 70.7% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 69.7% | MediumM | Solve→ |
Find All Anagrams in a String 68.7% | MediumM | Solve→ |
Longest Strictly Increasing or Strictly Decreasing Subarray 68.7% | EasyE | Solve→ |
67.6% | MediumM | Solve→ |
67.6% | MediumM | Solve→ |
Permutation in String 66.4% | MediumM | Solve→ |
Find the Prefix Common Array of Two Arrays 66.4% | MediumM | Solve→ |
65.2% | EasyE | Solve→ |
Squares of a Sorted Array 63.9% | EasyE | Solve→ |
62.4% | HardH | Solve→ |
62.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Interval List Intersections 62.4% | MediumM | Solve→ |
60.9% | EasyE | Solve→ |
Merge Two Sorted Lists 60.9% | EasyE | Solve→ |
60.9% | EasyE | Solve→ |
Design an ATM Machine 60.9% | MediumM | Solve→ |
Is Subsequence 59.2% | EasyE | Solve→ |
Find Duplicate Subtrees 59.2% | MediumM | Solve→ |
Symmetric Tree 57.4% | EasyE | Solve→ |
Max Consecutive Ones III 57.4% | MediumM | Solve→ |
57.4% | MediumM | Solve→ |
Binary Tree Right Side View 57.4% | MediumM | Solve→ |
57.4% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 55.4% | MediumM | Solve→ |
53.1% | MediumM | Solve→ |
53.1% | HardH | Solve→ |
53.1% | MediumM | Solve→ |
53.1% | MediumM | Solve→ |
Reconstruct Itinerary 53.1% | HardH | Solve→ |
50.6% | HardH | Solve→ |
Binary Tree Maximum Path Sum 50.6% | HardH | Solve→ |
Longest Substring with At Most K Distinct Characters 50.6% | MediumM | Solve→ |
Design Hit Counter 50.6% | MediumM | Solve→ |
Count Substrings Without Repeating Character 50.6% | MediumM | Solve→ |
47.7% | MediumM | Solve→ |
Remove Element 47.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Recent Calls 47.7% | EasyE | Solve→ |
Remove Duplicates from Sorted Array 47.7% | EasyE | Solve→ |
47.7% | MediumM | Solve→ |
44.2% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 44.2% | MediumM | Solve→ |
44.2% | EasyE | Solve→ |
Reverse Linked List 44.2% | EasyE | Solve→ |
Perfect Squares 44.2% | MediumM | Solve→ |
Longest Repeating Character Replacement 44.2% | MediumM | Solve→ |
Destination City 44.2% | EasyE | Solve→ |
Can Place Flowers 44.2% | EasyE | Solve→ |
44.2% | MediumM | Solve→ |
Simplify Path 40% | MediumM | Solve→ |
Intersection of Two Arrays 40% | EasyE | Solve→ |
Max Consecutive Ones 40% | EasyE | Solve→ |
Product of Two Run-Length Encoded Arrays 40% | MediumM | Solve→ |
4Sum 40% | MediumM | Solve→ |
34.5% | HardH | Solve→ |
Find Minimum in Rotated Sorted Array 34.5% | MediumM | Solve→ |
Longest Increasing Subsequence 34.5% | MediumM | Solve→ |
Intersection of Two Arrays II 34.5% | EasyE | Solve→ |
First Unique Character in a String 34.5% | EasyE | Solve→ |
Longest Continuous Increasing Subsequence 34.5% | EasyE | Solve→ |
Range Sum of BST 34.5% | EasyE | Solve→ |
Merge Two 2D Arrays by Summing Values 34.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Implement Queue using Stacks 34.5% | EasyE | Solve→ |
Design an Ordered Stream 34.5% | EasyE | Solve→ |
Remove Nth Node From End of List 34.5% | MediumM | Solve→ |
Binary Tree Level Order Traversal 34.5% | MediumM | Solve→ |
Find Median from Data Stream 34.5% | HardH | Solve→ |
Add Strings 34.5% | EasyE | Solve→ |
Matrix Diagonal Sum 34.5% | EasyE | Solve→ |
34.5% | HardH | Solve→ |
Allow One Function Call 34.5% | EasyE | Solve→ |
Maximum Average Subarray I 34.5% | EasyE | Solve→ |
Function Composition 34.5% | EasyE | Solve→ |
Evaluate Reverse Polish Notation 34.5% | MediumM | Solve→ |
34.5% | EasyE | Solve→ |
Reverse Integer 27.1% | MediumM | Solve→ |
Validate Binary Search Tree 27.1% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 27.1% | MediumM | Solve→ |
Majority Element 27.1% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 27.1% | MediumM | Solve→ |
Valid Anagram 27.1% | EasyE | Solve→ |
Longest Substring with At Least K Repeating Characters 27.1% | MediumM | Solve→ |
Continuous Subarray Sum 27.1% | MediumM | Solve→ |
Monotonic Array 27.1% | EasyE | Solve→ |
27.1% | MediumM | Solve→ |
27.1% | MediumM | Solve→ |
Implement Rand10() Using Rand7() 27.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Daily Temperatures 27.1% | MediumM | Solve→ |
Swap Nodes in Pairs 27.1% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree III 27.1% | MediumM | Solve→ |
Linked List Cycle 27.1% | EasyE | Solve→ |
Create Hello World Function 27.1% | EasyE | Solve→ |
Cinema Seat Allocation 27.1% | MediumM | Solve→ |
Counter II 27.1% | EasyE | Solve→ |
Search Insert Position 27.1% | EasyE | Solve→ |
Path Crossing 27.1% | EasyE | Solve→ |
27.1% | MediumM | Solve→ |
Employees Earning More Than Their Managers 27.1% | EasyE | Solve→ |
Find the Difference of Two Arrays 27.1% | EasyE | Solve→ |
Find Common Elements Between Two Arrays 27.1% | EasyE | Solve→ |
Subarray Sums Divisible by K 27.1% | MediumM | Solve→ |
Minimum Size Subarray Sum 27.1% | MediumM | Solve→ |
Search a 2D Matrix 27.1% | MediumM | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 27.1% | MediumM | Solve→ |
Maximum Product of Two Elements in an Array 27.1% | EasyE | Solve→ |
27.1% | MediumM | Solve→ |
Zigzag Iterator 27.1% | MediumM | Solve→ |
Binary Search 27.1% | EasyE | Solve→ |
Meeting Scheduler 27.1% | MediumM | Solve→ |
27.1% | MediumM | Solve→ |
Subarrays with K Different Integers 27.1% | HardH | Solve→ |
Add Binary 27.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Yandex?
Our current Yandex practice dataset contains 131 tagged coding problems, including Longest Subarray of 1's After Deleting One Element, Maximize Distance to Closest Person, Summary Ranges. The difficulty breakdown is 51 Easy, 71 Medium, and 9 Hard problems.
How should I prepare for a Yandex coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Yandex interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Yandex coding interviews?
Based on our data, Yandex interviews include 51 Easy (39%), 71 Medium (54%), and 9 Hard (7%) problems.
Ready to ace your Yandex interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required