InMobi LeetCode Questions
6 questions all-time · 0 easy · 3 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Reach a Number Math, Binary Search | Medium | 100 | 43.9% |
| 2 | Partition Labels Hash Table, Two Pointers, String, Greedy | Medium | 65 | 81.5% |
| 3 | Maximum Number of Robots Within Budget Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue | Hard | 65 | 36.8% |
| 4 | Redundant Connection Depth-First Search, Breadth-First Search, Union Find, Graph | Medium | 65 | 66.5% |
| 5 | Longest Valid Parentheses String, Dynamic Programming, Stack | Hard | 65 | 36.3% |
| 6 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 65 | 65.1% |
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.