Question 1

Longest Subarray of 1's After Deleting One Element — Yandex Interview Question

Accepted Answer

"Longest Subarray of 1's After Deleting One Element" is a medium difficulty problem asked at Yandex interviews. It covers the following topics: Array, Dynamic Programming, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element

Question 2

Summary Ranges — Yandex Interview Question

Accepted Answer

"Summary Ranges" is a easy difficulty problem asked at Yandex interviews. It covers the following topics: Array. You can practice it on LeetCode: https://leetcode.com/problems/summary-ranges

Question 3

String Compression — Yandex Interview Question

Accepted Answer

"String Compression" is a medium difficulty problem asked at Yandex interviews. It covers the following topics: Two Pointers, String. You can practice it on LeetCode: https://leetcode.com/problems/string-compression

Question 4

Find K Closest Elements — Yandex Interview Question

Accepted Answer

"Find K Closest Elements" is a medium difficulty problem asked at Yandex interviews. It covers the following topics: Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue). You can practice it on LeetCode: https://leetcode.com/problems/find-k-closest-elements

Question 5

Isomorphic Strings — Yandex Interview Question

Accepted Answer

"Isomorphic Strings" is a easy difficulty problem asked at Yandex interviews. It covers the following topics: Hash Table, String. You can practice it on LeetCode: https://leetcode.com/problems/isomorphic-strings

Question 6

Subarray Sum Equals K — Yandex Interview Question

Accepted Answer

"Subarray Sum Equals K" is a medium difficulty problem asked at Yandex interviews. It covers the following topics: Array, Hash Table, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/subarray-sum-equals-k

#	Question Title	Difficulty	Frequency	Topics
1	Longest Subarray of 1's After Deleting One Element	MEDIUM	100.0	ArrayDynamic ProgrammingSliding Window
2	Summary Ranges	EASY	95.2	Array
3	String Compression	MEDIUM	89.2	Two PointersString
4	Find K Closest Elements	MEDIUM	88.3	ArrayTwo PointersBinary Search+3
5	Isomorphic Strings	EASY	83.9	Hash TableString
6	Subarray Sum Equals K	MEDIUM	82.3	ArrayHash TablePrefix Sum
7	Permutation in String	MEDIUM	81.9	Hash TableTwo PointersString+1
8	Insert Delete GetRandom O(1)	MEDIUM	81.0	ArrayHash TableMath+2
9	Valid Palindrome	EASY	81.0	Two PointersString
10	Move Zeroes	EASY	80.6	ArrayTwo Pointers

Explore 450+ Companies

Companies

Yandex

Want to see more?

Yandex Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Yandex

Want to see more?

Yandex Interview Questions

Ai Assistant Kas