Yandex Interview Questions — 100 DSA Problems

94 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Yandex LeetCode questions for software engineering interviews.

• Longest Subarray of 1's After Deleting One Element (MEDIUM) — Array, Dynamic Programming, Sliding Window
• Summary Ranges (EASY) — Array
• String Compression (MEDIUM) — Two Pointers, String
• Find K Closest Elements (MEDIUM) — Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)
• Isomorphic Strings (EASY) — Hash Table, String
• Subarray Sum Equals K (MEDIUM) — Array, Hash Table, Prefix Sum
• Permutation in String (MEDIUM) — Hash Table, Two Pointers, String, Sliding Window
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Valid Palindrome (EASY) — Two Pointers, String
• Move Zeroes (EASY) — Array, Two Pointers
• Line Reflection (MEDIUM) — Array, Hash Table, Math
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Merge Intervals (MEDIUM) — Array, Sorting
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Two Sum (EASY) — Array, Hash Table
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Valid Parentheses (EASY) — String, Stack
• One Edit Distance (MEDIUM) — Two Pointers, String
• Valid Palindrome II (EASY) — Two Pointers, String, Greedy
• Interval List Intersections (MEDIUM) — Array, Two Pointers, Line Sweep
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Find All Anagrams in a String (MEDIUM) — Hash Table, String, Sliding Window
• Min Stack (MEDIUM) — Stack, Design
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Design an ATM Machine (MEDIUM) — Array, Greedy, Design
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Design Hit Counter (MEDIUM) — Array, Binary Search, Design, Queue, Data Stream
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Evaluate Reverse Polish Notation (MEDIUM) — Array, Math, Stack
• Is Subsequence (EASY) — Two Pointers, String, Dynamic Programming
• Validate Binary Search Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Longest Substring with At Most K Distinct Characters (MEDIUM) — Hash Table, String, Sliding Window
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Binary Tree Right Side View (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Destination City (EASY) — Array, Hash Table, String
• Reconstruct Itinerary (HARD) — Depth-First Search, Graph, Eulerian Circuit
• Lowest Common Ancestor of a Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Max Consecutive Ones III (MEDIUM) — Array, Binary Search, Sliding Window, Prefix Sum
• Simplify Path (MEDIUM) — String, Stack
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Find Duplicate Subtrees (MEDIUM) — Hash Table, Tree, Depth-First Search, Binary Tree
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Intersection of Two Arrays II (EASY) — Array, Hash Table, Two Pointers, Binary Search, Sorting
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Symmetric Tree (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy