MeeshoLeetCode Questions
VerifiedCompany-wise coding interview questions asked by Meesho, ranked by real frequency across 30-day, 3-month, and 6-month recency windows.
# | Problem | Difficulty | Frequency↓ | Acceptance | |
|---|---|---|---|---|---|
| #3514 | Number of Unique XOR Triplets II3 sources | Medium | 100% | 32.7% | |
| #3513 | Number of Unique XOR Triplets I3 sources | Medium | 100% | 26.9% | |
| #2930 | Medium | 100% | 57.4% | ||
| #2959 | Hard | 100% | 51.5% | ||
| #2953 | Count Complete Substrings3 sources | Hard | 100% | 30.9% | |
| #3709 | Design Exam Scores Tracker3 sources | Medium | 92% | 44.3% | |
| #3715 | Sum of Perfect Square Ancestors3 sources | Hard | 92% | 42.8% | |
| #197 | Easy | 88% | 51.6% | ||
| #2444 | Count Subarrays With Fixed Bounds3 sources | Hard | 80% | 69.2% | |
| #754 | Reach a Number3 sources | Medium | 80% | 45.3% | |
| #180 | Medium | 75% | 48.8% | ||
| #2187 | Minimum Time to Complete Trips3 sources | Medium | 75% | 39.8% | |
| #1639 | Hard | 75% | 56.4% | ||
| #355 | Design Twitter3 sources | Medium | 75% | 45.1% | |
| #626 | Medium | 75% | 74.4% | ||
| #1326 | Hard | 75% | 51.0% | ||
| #2742 | Painting the Walls3 sources | Hard | 75% | 49.2% | |
| #2858 | Hard | 67% | 60.0% | ||
| #31 | Next Permutation3 sources | Medium | 67% | 45.6% | |
| #328 | Odd Even Linked List3 sources | Medium | 67% | 62.6% | |
| #886 | Possible Bipartition3 sources | Medium | 67% | 52.8% | |
| #115 | Distinct Subsequences3 sources | Hard | 67% | 52.2% | |
| #1235 | Maximum Profit in Job Scheduling3 sources | Hard | 67% | 54.8% | |
| #740 | Delete and Earn3 sources | Medium | 57% | 57.4% | |
| #55 | Jump Game3 sources | Medium | 57% | 41.2% | |
| #735 | Asteroid Collision3 sources | Medium | 57% | 48.4% | |
| #1944 | Number of Visible People in a Queue3 sources | Hard | 57% | 73.3% | |
| #200 | Number of Islands3 sources | Medium | 57% | 64.7% | |
| #15 | 3Sum3 sources | Medium | 57% | 39.4% | |
| #2603 | Collect Coins in a Tree3 sources | Hard | 57% | 39.5% | |
| #295 | Find Median from Data Stream3 sources | Hard | 57% | 54.7% | |
| #805 | Split Array With Same Average3 sources | Hard | 57% | 27.2% | |
| #2751 | Robot Collisions3 sources | Hard | 57% | 61.6% | |
| #76 | Minimum Window Substring3 sources | Hard | 57% | 47.9% | |
| #587 | Erect the Fence3 sources | Hard | 57% | 53.1% | |
| #149 | Max Points on a Line3 sources | Hard | 57% | 31.0% | |
| #53 | Maximum Subarray3 sources | Medium | 57% | 53.5% | |
| #128 | Longest Consecutive Sequence3 sources | Medium | 57% | 47.2% | |
| #713 | Subarray Product Less Than K3 sources | Medium | 57% | 54.7% | |
| #122 | Best Time to Buy and Sell Stock II3 sources | Medium | 57% | 71.3% | |
| #2771 | Medium | 50% | 31.3% | ||
| #1 | Easy | 50% | 57.8% | ||
| #176 | Medium | 50% | 47.5% | ||
| #696 | Easy | 50% | 70.5% | ||
| #584 | Easy | 50% | 73.1% |
Meesho Technical Interview Overview & Company-Wise Questions
Software engineering and technical interviews at Meesho emphasize real-world problem solving, algorithmic efficiency, and scalable data structure design. The curated dataset above contains 45 verified LeetCode problems, categorized by frequency and filtered across recent interview seasons.
Frequently Asked Questions
What are the top LeetCode questions for Meesho?
Leading questions include Number of Unique XOR Triplets II, Number of Unique XOR Triplets I, Number of Strings Which Can Be Rearranged to Contain Substring. Reviewing questions with higher recency (within the last 30 to 90 days) yields the highest return on preparation time.
Where can I practice company-wise LeetCode questions for Meesho?
You can practice all 45 Meesho LeetCode questions right here on LeetMap Pro. Filter by 30-day, 3-month, and 6-month recency, track your progress with local checkpoints, and practice curated SQL problems completely free.
How should I prepare for Meesho coding rounds?
Begin by reviewing Medium-difficulty problems (23 tracked), which constitute the majority of technical rounds. Complement coding practice with foundational DSA patterns like Sliding Window, Two Pointers, and Graph Traversal.