All companies
Yandex
51 Easy69 Medium10 Hard130 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 228 | Summary Ranges | Easy | |
| 658 | Find K Closest Elements | Medium | |
| 849 | Maximize Distance to Closest Person | Medium | |
| 1 | Two Sum | Easy | |
| 5 | Longest Palindromic Substring | Medium | |
| 56 | Merge Intervals | Medium | |
| 125 | Valid Palindrome | Easy | |
| 161 | One Edit Distance | Medium | |
| 205 | Isomorphic Strings | Easy | |
| 283 | Move Zeroes | Easy | |
| 356 | Line Reflection | Medium | |
| 438 | Find All Anagrams in a String | Medium | |
| 443 | String Compression | Medium | |
| 560 | Subarray Sum Equals K | Medium | |
| 567 | Permutation in String | Medium | |
| 680 | Valid Palindrome II | Easy | |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | |
| 20 | Valid Parentheses | Easy | |
| 21 | Merge Two Sorted Lists | Easy | |
| 42 | Trapping Rain Water | Hard | |
| 49 | Group Anagrams | Medium | |
| 88 | Merge Sorted Array | Easy | |
| 155 | Min Stack | Medium | |
| 199 | Binary Tree Right Side View | Medium | |
| 200 | Number of Islands | Medium | |
| 986 | Interval List Intersections | Medium | |
| 2241 | Design an ATM Machine | Medium | |
| 380 | Insert Delete GetRandom O(1) | Medium | |
| 392 | Is Subsequence | Easy | |
| 652 | Find Duplicate Subtrees | Medium | |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium | |
| 977 | Squares of a Sorted Array | Easy | |
| 4 | Median of Two Sorted Arrays | Hard | |
| 11 | Container With Most Water | Medium | |
| 22 | Generate Parentheses | Medium | |
| 23 | Merge k Sorted Lists | Hard | |
| 27 | Remove Element | Easy | |
| 33 | Search in Rotated Sorted Array | Medium | |
| 101 | Symmetric Tree | Easy | |
| 124 | Binary Tree Maximum Path Sum | Hard | |
| 1004 | Max Consecutive Ones III | Medium | |
| 146 | LRU Cache | Medium | |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | |
| 238 | Product of Array Except Self | Medium | |
| 279 | Perfect Squares | Medium | |
| 332 | Reconstruct Itinerary | Hard | |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | |
| 362 | Design Hit Counter | Medium | |
| 933 | Number of Recent Calls | Easy | |
| 2743 | Count Substrings Without Repeating Character | Medium | |
| 53 | Maximum Subarray | Medium | |
| 2 | Add Two Numbers | Medium | |
| 71 | Simplify Path | Medium | |
| 76 | Minimum Window Substring | Hard | |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | |
| 121 | Best Time to Buy and Sell Stock | Easy | |
| 153 | Find Minimum in Rotated Sorted Array | Medium | |
| 206 | Reverse Linked List | Easy | |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | |
| 300 | Longest Increasing Subsequence | Medium | |
| 349 | Intersection of Two Arrays | Easy | |
| 350 | Intersection of Two Arrays II | Easy | |
| 387 | First Unique Character in a String | Easy | |
| 424 | Longest Repeating Character Replacement | Medium | |
| 485 | Max Consecutive Ones | Easy | |
| 523 | Continuous Subarray Sum | Medium | |
| 1436 | Destination City | Easy | |
| 605 | Can Place Flowers | Easy | |
| 896 | Monotonic Array | Easy | |
| 1868 | Product of Two Run-Length Encoded Arrays | Medium | |
| 674 | Longest Continuous Increasing Subsequence | Easy | |
| 938 | Range Sum of BST | Easy | |
| 17 | Letter Combinations of a Phone Number | Medium | |
| 227 | Basic Calculator II | Medium | |
| 26 | Remove Duplicates from Sorted Array | Easy | |
| 18 | 4Sum | Medium | |
| 232 | Implement Queue using Stacks | Easy | |
| 1656 | Design an Ordered Stream | Easy | |
| 19 | Remove Nth Node From End of List | Medium | |
| 102 | Binary Tree Level Order Traversal | Medium | |
| 295 | Find Median from Data Stream | Hard | |
| 415 | Add Strings | Easy | |
| 141 | Linked List Cycle | Easy | |
| 1572 | Matrix Diagonal Sum | Easy | |
| 239 | Sliding Window Maximum | Hard | |
| 2666 | Allow One Function Call | Easy | |
| 2629 | Function Composition | Easy | |
| 9 | Palindrome Number | Easy | |
| 7 | Reverse Integer | Medium | |
| 98 | Validate Binary Search Tree | Medium | |
| 167 | Two Sum II - Input Array Is Sorted | Medium | |
| 169 | Majority Element | Easy | |
| 234 | Palindrome Linked List | Easy | |
| 242 | Valid Anagram | Easy | |
| 395 | Longest Substring with At Least K Repeating Characters | Medium | |
| 771 | Jewels and Stones | Easy | |
| 68 | Text Justification | Hard | |
| 322 | Coin Change | Medium | |
| 2570 | Merge Two 2D Arrays by Summing Values | Easy | |
| 470 | Implement Rand10() Using Rand7() | Medium | |
| 739 | Daily Temperatures | Medium | |
| 24 | Swap Nodes in Pairs | Medium | |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | |
| 2667 | Create Hello World Function | Easy | |
| 1386 | Cinema Seat Allocation | Medium | |
| 2665 | Counter II | Easy | |
| 35 | Search Insert Position | Easy | |
| 1496 | Path Crossing | Easy | |
| 994 | Rotting Oranges | Medium | |
| 181 | Employees Earning More Than Their Managers | Easy | |
| 643 | Maximum Average Subarray I | Easy | |
| 2215 | Find the Difference of Two Arrays | Easy | |
| 2956 | Find Common Elements Between Two Arrays | Easy | |
| 974 | Subarray Sums Divisible by K | Medium | |
| 209 | Minimum Size Subarray Sum | Medium | |
| 74 | Search a 2D Matrix | Medium | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | |
| 150 | Evaluate Reverse Polish Notation | Medium | |
| 1464 | Maximum Product of Two Elements in an Array | Easy | |
| 54 | Spiral Matrix | Medium | |
| 281 | Zigzag Iterator | Medium | |
| 704 | Binary Search | Easy | |
| 1229 | Meeting Scheduler | Medium | |
| 347 | Top K Frequent Elements | Medium | |
| 992 | Subarrays with K Different Integers | Hard | |
| 67 | Add Binary | Easy | |
| 487 | Max Consecutive Ones II | Medium | |
| 36 | Valid Sudoku | Medium |