InMobi LeetCode interview questions

Explore InMobi questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 13

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Trionic Array II Array Dynamic Programming HARD	Hard	100.0%	0.5%
Cherry Pickup Array Dynamic Programming Matrix HARD	Hard	97.5%	0.4%
Reach a Number Math Binary Search MEDIUM	Medium	94.8%	0.5%
Count Number of Nice Subarrays Array Hash Table Math +2 MEDIUM	Medium	91.6%	0.8%
Zuma Game String Dynamic Programming Stack +2 HARD	Hard	83.7%	0.3%
Strange Printer String Dynamic Programming HARD	Hard	83.7%	0.6%
Frog Position After T Seconds Tree Depth-First Search Breadth-First Search +1 HARD	Hard	78.5%	0.4%
Critical Connections in a Network Depth-First Search Graph Theory Biconnected Component +1 HARD	Hard	78.5%	0.6%
Longest Valid Parentheses String Dynamic Programming Stack +1 HARD	Hard	62.2%	0.4%
Lexicographically Maximum MEX Array Array Hash Table Greedy +1 HARD	Hard	62.2%	0.5%
Capacity To Ship Packages Within D Days Array Binary Search MEDIUM	Medium	62.2%	0.7%
Longest Repeating Character Replacement Hash Table String Sliding Window MEDIUM	Medium	62.2%	0.6%
Minimum Time to Transport All Individuals Array Bit Manipulation Graph Theory +3 HARD	Hard	62.2%	0.3%

Showing 1–13 of 13 matching problems · All Problems

InMobi LeetCode Interview Questions | Grind Practice