Meesho
36 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3514. Number of Unique XOR Triplets II | Medium | 100% | TopicsArrayMathBit ManipulationEnumeration |
| 3513. Number of Unique XOR Triplets I | Medium | 97.6% | TopicsArrayMathBit Manipulation |
| 2930. Number of Strings Which Can Be Rearranged to Contain Substring | Medium | 92% | TopicsMathDynamic ProgrammingCombinatorics |
| 2959. Number of Possible Sets of Closing Branches | Hard | 92% | TopicsBit ManipulationGraph TheoryHeap (Priority Queue)EnumerationShortest Path |
| 2953. Count Complete Substrings | Hard | 92% | TopicsHash TableStringSliding Window |
| 3709. Design Exam Scores Tracker | Medium | 92% | TopicsArrayBinary SearchDesignPrefix Sum |
| 3715. Sum of Perfect Square Ancestors | Hard | 92% | TopicsArrayHash TableMathTreeDepth-First SearchCountingNumber Theory |
| Rising Temperature | Easy | 84.7% | TopicsDatabase |
| 2444. Count Subarrays With Fixed Bounds | Hard | 80.1% | TopicsArrayQueueSliding WindowMonotonic Queue |
| 754. Reach a Number | Medium | 80.1% | TopicsMathBinary Search |
| 1639. Number of Ways to Form a Target String Given a Dictionary | Hard | 74.5% | TopicsArrayStringDynamic Programming |
| Exchange Seats | Medium | 74.5% | TopicsDatabase |
| 2858. Minimum Edge Reversals So Every Node Is Reachable | Hard | 67.2% | TopicsDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theory |
| 355. Design Twitter | Medium | 67.2% | TopicsHash TableLinked ListDesignHeap (Priority Queue) |
| Next Permutation | Medium | 67.2% | TopicsArrayTwo Pointers |
| Odd Even Linked List | Medium | 67.2% | TopicsLinked List |
| 886. Possible Bipartition | Medium | 67.2% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryGraph ColoringBipartite Graph |
| 805. Split Array With Same Average | Hard | 67.2% | TopicsArrayHash TableMathDynamic ProgrammingBit ManipulationMeet in the MiddleBitmask |
| 115. Distinct Subsequences | Hard | 67.2% | TopicsStringDynamic Programming |
| 1235. Maximum Profit in Job Scheduling | Hard | 67.2% | TopicsArrayBinary SearchDynamic ProgrammingSorting |
| 1326. Minimum Number of Taps to Open to Water a Garden | Hard | 57% | TopicsArrayDynamic ProgrammingGreedy |
| Consecutive Numbers | Medium | 57% | TopicsDatabase |
| 2187. Minimum Time to Complete Trips | Medium | 57% | TopicsArrayBinary Search |
| Asteroid Collision | Medium | 57% | TopicsArrayStackSimulation |
| 1944. Number of Visible People in a Queue | Hard | 57% | TopicsArrayStackMonotonic Stack |
