InMobi
13 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3640. Trionic Array II | Hard | 100% | TopicsArrayDynamic Programming |
| Cherry Pickup | Hard | 97.5% | TopicsArrayDynamic ProgrammingMatrix |
| 754. Reach a Number | Medium | 94.8% | TopicsMathBinary Search |
| 1248. Count Number of Nice Subarrays | Medium | 91.6% | TopicsArrayHash TableMathSliding WindowPrefix Sum |
| Zuma Game | Hard | 83.7% | TopicsStringDynamic ProgrammingStackBreadth-First SearchMemoization |
| Strange Printer | Hard | 83.7% | TopicsStringDynamic Programming |
| 1377. Frog Position After T Seconds | Hard | 78.5% | TopicsTreeDepth-First SearchBreadth-First SearchGraph Theory |
| 1192. Critical Connections in a Network | Hard | 78.5% | TopicsDepth-First SearchGraph TheoryBiconnected ComponentBridge (Graph) |
| Longest Valid Parentheses | Hard | 62.2% | TopicsStringDynamic ProgrammingStackBracket Sequences |
| 3948. Lexicographically Maximum MEX Array | Hard | 62.2% | TopicsArrayHash TableGreedyQueue |
| 1011. Capacity To Ship Packages Within D Days | Medium | 62.2% | TopicsArrayBinary Search |
| 424. Longest Repeating Character Replacement | Medium | 62.2% | TopicsHash TableStringSliding Window |
| 3594. Minimum Time to Transport All Individuals | Hard | 62.2% | TopicsArrayBit ManipulationGraph TheoryHeap (Priority Queue)Shortest PathBitmask |
