Yandex LeetCode interview questions

Explore Yandex questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

120

Solved

0 / 120

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Longest Subarray of 1's After Deleting One Element Array Dynamic Programming Sliding Window MEDIUM	Medium	100.0%	0.7%
Summary Ranges Array EASY	Easy	91.6%	0.5%
Maximize Distance to Closest Person Array MEDIUM	Medium	91.6%	0.5%
Longest Substring Without Repeating Characters Hash Table String Sliding Window MEDIUM	Medium	86.4%	0.4%
Valid Palindrome II Two Pointers String Greedy EASY	Easy	83.8%	0.4%
Find K Closest Elements Array Two Pointers Binary Search +3 MEDIUM	Medium	83.3%	0.5%
String Compression Two Pointers String MEDIUM	Medium	82.1%	0.6%
Subarray Sum Equals K Array Hash Table Prefix Sum MEDIUM	Medium	79.5%	0.5%
Merge Intervals Array Sorting Quicksort MEDIUM	Medium	78.0%	0.5%
Move Zeroes Array Two Pointers EASY	Easy	72.9%	0.6%
Insert Delete GetRandom O(1) Array Hash Table Math +2 MEDIUM	Medium	71.9%	0.6%
Longest Strictly Increasing or Strictly Decreasing Subarray Array EASY	Easy	71.9%	0.6%
Valid Palindrome Two Pointers String EASY	Easy	70.8%	0.5%
Isomorphic Strings Hash Table String EASY	Easy	70.8%	0.5%
Longest Palindromic Substring Two Pointers String Dynamic Programming +1 MEDIUM	Medium	69.7%	0.4%
Line Reflection Array Hash Table Math MEDIUM	Medium	69.7%	0.4%
Two Sum Array Hash Table EASY	Easy	68.5%	0.6%
One Edit Distance Two Pointers String MEDIUM	Medium	68.5%	0.3%
Permutation in String Hash Table Two Pointers String +1 MEDIUM	Medium	68.5%	0.5%
Interval List Intersections Array Two Pointers Sweep Line MEDIUM	Medium	67.3%	0.7%

Showing 1–20 of 120 matching problems · All Problems

Yandex LeetCode Interview Questions | Grind Practice