Indian
InMobi interview questions
Grouped by topic, sorted Easy → Medium → Hard, then by LeetCode ID. Click a problem to open it on LeetCode; the chapter column links to the handbook chapter that covers it.
- Problems
- 22
- Easy
- 4
- Medium
- 8
- Hard
- 10
- Mapped to chapter
- 12
String
6 problemsEasy 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 796 | Rotate Stringalso at:ZohoAmazonBloomberg Also at 4 moreeBayGoogleMetaMicrosoft | Easy | Chapter |
Hard 5
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 32 | Longest Valid Parenthesesalso at:FlipkartGrowwNykaa Also at 8 moreAdobeAmazonBloombergeBayGoogleIntuitMetaMicrosoft | Hard | — | |
| 44 | Wildcard Matchingalso at:ZohoAdobeAmazon Also at 8 moreBloombergByteDanceGoogleInstacartMicrosoftSnapTwo SigmaX (Twitter) | Hard | — | |
| 297 | Serialize and Deserialize Binary Treealso at:FlipkartAmazonCitadel Also at 10 moreDoorDasheBayGoogleIntuitMetaMicrosoftPayPalQualcommTeslaVMware | Hard | Chapter | |
| 488 | Zuma Gamealso at:PhonePe | Hard | — | |
| 664 | Strange Printeralso at:Salesforce | Hard | Chapter |
Array
4 problemsMedium 2
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 63 | Unique Paths IIalso at:AmazonAtlassianBloomberg Also at 3 moreGoogleMicrosoftVMware | Medium | — | |
| 240 | Search a 2D Matrix IIalso at:AirtelOlaOYO Also at 11 moreZomatoAdobeAmazonBloombergByteDanceCitadeleBayGoogleMicrosoftPayPalSnap | Medium | — |
Hard 2
Hash Table
3 problemsEasy 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 13 | Roman to Integeralso at:AdobeAmazonAMD Also at 8 moreBloombergDoorDashGoldman SachsGoogleMetaMicrosoftRakutenReddit | Easy | — |
Medium 1
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 763 | Partition Labels★ also at:Amazon | Medium | Chapter |
Misc
9 problemsEasy 2
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 110 | Balanced Binary Tree★ also at:AdobeAmazonBloomberg Also at 4 moreByteDanceGoogleMetaMicrosoft | Easy | Chapter | |
| 232 | Implement Queue using Stacksalso at:AmazonAppleGoogle Also at 4 moreMicrosoftNetflixQualcommSAP | Easy | Chapter |
Medium 5
| # | Title | Difficulty | Also at | Chapter |
|---|---|---|---|---|
| 19 | Remove Nth Node From End of Listalso at:AdobeAmazonApple Also at 8 moreByteDanceGoogleLINEMetaMicrosoftMorgan StanleyQualcommVMware | Medium | — | |
| 62 | Unique Paths★ also at:FlipkartRazorpayAdobe Also at 8 moreAmazonBloombergGoldman SachsGoogleMetaMicrosoftQualcommVMware | Medium | Chapter | |
| 684 | Redundant Connection★ also at:NaviAmazonBloomberg | Medium | Chapter | |
| 754 | Reach a Numberalso at:Meesho | Medium | — | |
| 787 | Cheapest Flights Within K Stops★ also at:FlipkartAirbnbAmazon Also at 8 moreAppleBloombergeBayGoogleMicrosoftSnapStripeUber | Medium | Chapter |
No problems match those filters
Toggle a difficulty back on or clear the search.