Back to Companies

Yandex Interview Questions (134)

Practice real interview problems from Yandex

All134 Easy52 Medium72 Hard10

Status	Title	Solution	Practice	Difficulty	Companies	Topics
	4. Median of Two Sorted Arrays	Solution	Solve	Hard	Accenture+46	Array Binary Search+1
	23. Merge k Sorted Lists	Solution	Solve	Hard	Accenture+52	Divide and Conquer Heap (Priority Queue)+2
	42. Trapping Rain Water	Solution	Solve	Hard	Accenture+77	Array Dynamic Programming+3
	68. Text Justification	Solution	Solve	Hard	Airbnb+39	Array Simulation+1
	76. Minimum Window Substring	Solution	Solve	Hard	Adobe+33	Hash Table Sliding Window+1
	124. Binary Tree Maximum Path Sum	Solution	Solve	Hard	Amazon+24	Binary Tree Depth-First Search+2
	220. Contains Duplicate III	Solution	Solve	Hard	Airbnb+8	Array Bucket Sort+3
	239. Sliding Window Maximum	Solution	Solve	Hard	Adobe+47	Array Heap (Priority Queue)+3
	295. Find Median from Data Stream	Solution	Solve	Hard	Amazon+37	Data Stream Design+3
	332. Reconstruct Itinerary	Solution	Solve	Hard	Amazon+21	Depth-First Search Eulerian Circuit+1

Median of Two Sorted Arrays

Hard✓ Solution📹 Video

Accenture+46

Array Binary Search Divide and Conquer

Merge k Sorted Lists

Hard✓ Solution📹 Video

Accenture+52

Divide and Conquer Heap (Priority Queue)Linked List+1

Trapping Rain Water

Hard✓ Solution

Accenture+77

Array Dynamic Programming Monotonic Stack+2

Text Justification

Hard✓ Solution

Airbnb+39

Array Simulation String

Minimum Window Substring

Hard✓ Solution

Adobe+33

Hash Table Sliding Window String

Binary Tree Maximum Path Sum

Hard✓ Solution

Amazon+24

Binary Tree Depth-First Search Dynamic Programming+1

Contains Duplicate III

Hard✓ Solution

Airbnb+8

Array Bucket Sort Ordered Set+2

Sliding Window Maximum

Hard✓ Solution

Adobe+47

Array Heap (Priority Queue)Monotonic Queue+2

Find Median from Data Stream

Hard✓ Solution

Amazon+37

Data Stream Design Heap (Priority Queue)+2

Reconstruct Itinerary

Hard

Amazon+21

Depth-First Search Eulerian Circuit Graph