Meesho LeetCode Questions
22 questions all-time · 1 easy · 12 medium · 9 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Minimum Edge Reversals So Every Node Is Reachable Dynamic Programming, Depth-First Search, Breadth-First Search, Graph | Hard | 100 | 55.3% |
| 2 | Number of Strings Which Can Be Rearranged to Contain Substring Math, Dynamic Programming, Combinatorics | Medium | 78 | 55.3% |
| 3 | Making A Large Island Array, Depth-First Search, Breadth-First Search, Union Find, Matrix | Hard | 78 | 54.9% |
| 4 | Delete and Earn Array, Hash Table, Dynamic Programming | Medium | 78 | 56.7% |
| 5 | Painting the Walls Array, Dynamic Programming | Hard | 78 | 48.5% |
| 6 | Minimum Number of Taps to Open to Water a Garden Array, Dynamic Programming, Greedy | Hard | 71 | 50.7% |
| 7 | Two Sum Array, Hash Table | Easy | 71 | 55.8% |
| 8 | Subsequence With the Minimum Score Two Pointers, String, Binary Search | Hard | 71 | 32.6% |
| 9 | Design Twitter Hash Table, Linked List, Design, Heap (Priority Queue) | Medium | 71 | 42.7% |
| 10 | Consecutive Numbers Database | Medium | 61 | 46.1% |
| 11 | Count Subarrays With Fixed Bounds Array, Queue, Sliding Window, Monotonic Queue | Hard | 61 | 69.4% |
| 12 | Beautiful Arrangement Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 61 | 64.5% |
| 13 | Minimum Time to Complete Trips Array, Binary Search | Medium | 61 | 39.0% |
| 14 | Car Pooling Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum | Medium | 61 | 56.0% |
| 15 | Jump Game Array, Dynamic Programming, Greedy | Medium | 61 | 39.5% |
| 16 | Search Suggestions System Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue) | Medium | 61 | 65.1% |
| 17 | Find the Longest Equal Subarray Array, Hash Table, Binary Search, Sliding Window | Medium | 61 | 36.2% |
| 18 | Longest Non-decreasing Subarray From Two Arrays Array, Dynamic Programming | Medium | 61 | 29.8% |
| 19 | Count Complete Substrings Hash Table, String, Sliding Window | Hard | 61 | 28.5% |
| 20 | Number of Possible Sets of Closing Branches Bit Manipulation, Graph, Heap (Priority Queue), Enumeration, Shortest Path | Hard | 61 | 48.4% |
| 21 | Minimum Degree of a Connected Trio in a Graph Graph | Hard | 61 | 43.4% |
| 22 | Second Highest Salary Database | Medium | 61 | 43.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.