Media.net LeetCode Questions
39 questions all-time · 7 easy · 17 medium · 15 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Minimum Operations to Form Subsequence With Target Sum Array, Greedy, Bit Manipulation | Hard | 100 | 31.3% |
| 2 | Count the Number of Square-Free Subsets Array, Math, Dynamic Programming, Bit Manipulation, Bitmask | Medium | 93 | 25.2% |
| 3 | Scramble String String, Dynamic Programming | Hard | 86 | 42.2% |
| 4 | Maximum Genetic Difference Query Array, Hash Table, Bit Manipulation, Depth-First Search, Trie | Hard | 86 | 44.3% |
| 5 | Furthest Building You Can Reach Array, Greedy, Heap (Priority Queue) | Medium | 82 | 50.4% |
| 6 | Minimum Total Space Wasted With K Resizing Operations Array, Dynamic Programming | Medium | 82 | 43.0% |
| 7 | Make the XOR of All Segments Equal to Zero Array, Dynamic Programming, Bit Manipulation | Hard | 82 | 39.9% |
| 8 | Minimum Time Visiting All Points Array, Math, Geometry | Easy | 82 | 82.6% |
| 9 | Minimum XOR Sum of Two Arrays Array, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 82 | 49.1% |
| 10 | Minimum Cost to Buy Apples Array, Graph, Heap (Priority Queue), Shortest Path | Medium | 82 | 67.1% |
| 11 | Queens That Can Attack the King Array, Matrix, Simulation | Medium | 82 | 72.2% |
| 12 | Maximum XOR of Two Non-Overlapping Subtrees Tree, Depth-First Search, Graph, Trie | Hard | 82 | 49.6% |
| 13 | Difference Between Maximum and Minimum Price Sum Array, Dynamic Programming, Tree, Depth-First Search | Hard | 82 | 31.8% |
| 14 | Sum of Remoteness of All Cells Array, Hash Table, Depth-First Search, Breadth-First Search, Union Find, Matrix | Medium | 82 | 70.8% |
| 15 | Maximum Value of an Ordered Triplet II Array | Medium | 82 | 56.7% |
| 16 | Maximum Value of an Ordered Triplet I Array | Easy | 82 | 58.3% |
| 17 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 77 | 55.3% |
| 18 | Flatten Binary Tree to Linked List Linked List, Stack, Tree, Depth-First Search, Binary Tree | Medium | 74 | 68.5% |
| 19 | Substring with Concatenation of All Words Hash Table, String, Sliding Window | Hard | 74 | 33.0% |
| 20 | Merge Two Sorted Lists Linked List, Recursion | Easy | 71 | 66.8% |
| 21 | Painting the Walls Array, Dynamic Programming | Hard | 67 | 48.5% |
| 22 | Fizz Buzz Math, String, Simulation | Easy | 62 | 74.4% |
| 23 | Jump Game Array, Dynamic Programming, Greedy | Medium | 62 | 39.5% |
| 24 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 56 | 45.2% |
| 25 | Number of Submatrices That Sum to Target Array, Hash Table, Matrix, Prefix Sum | Hard | 56 | 74.5% |
| 26 | Binary Search Tree Iterator Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator | Medium | 56 | 74.9% |
| 27 | Valid Phone Numbers Shell | Easy | 56 | 27.5% |
| 28 | The Number of Good Subsets Array, Math, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 56 | 35.9% |
| 29 | Valid Sudoku Array, Hash Table, Matrix | Medium | 56 | 62.3% |
| 30 | Best Time to Buy and Sell Stock II Array, Dynamic Programming, Greedy | Medium | 56 | 69.5% |
| 31 | All O`one Data Structure Hash Table, Linked List, Design, Doubly-Linked List | Hard | 47 | 44.1% |
| 32 | Merge Intervals Array, Sorting | Medium | 47 | 49.4% |
| 33 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 47 | 47.6% |
| 34 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 47 | 35.8% |
| 35 | Sum of Distances in Tree Dynamic Programming, Tree, Depth-First Search, Graph | Hard | 47 | 65.3% |
| 36 | Majority Element Array, Hash Table, Divide and Conquer, Sorting, Counting | Easy | 47 | 65.7% |
| 37 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 47 | 65.1% |
| 38 | Search in Rotated Sorted Array Array, Binary Search | Medium | 47 | 42.8% |
| 39 | Minimize the Maximum Difference of Pairs Array, Binary Search, Dynamic Programming, Greedy, Sorting | Medium | 47 | 50.9% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.