IIT Bombay coding interview
questions, leaked.
2 problems reported across recent IIT Bombay interviews. Top patterns: two pointers, string, string matching. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
IIT Bombay's coding assessments are lean, focused, and deceptively hard. With only 2 problems reported, you're not grinding through a hundred edge cases. You're solving one easy string-matching problem and one medium that combines greedy logic with bit manipulation on a matrix. The stakes are higher when there's no room for error. If you blank on bit operations or greedy choice validation during the live assessment, StealthCoder surfaces a working solution in seconds, invisible to any proctor watching your screen.
Top problems at IIT Bombay
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Score After Flipping Matrix | MEDIUM | 100.0 | 80% | Array · Greedy · Bit Manipulation |
| 02 | Find the Index of the First Occurrence in a String | EASY | 68.4 | 45% | Two Pointers · String · String Matching |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual IIT Bombay OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- two pointers1 · 50%
- string1 · 50%
- string matching1 · 50%
- array1 · 50%
- greedy1 · 50%
- bit manipulation1 · 50%
- matrix1 · 50%
The problem set skews toward pattern recognition over brute force. The easy problem tests string searching and two-pointer traversal, baseline competency. The medium escalates sharply: you need to see that flipping matrix rows greedily, then columns, minimizes the final score using bit logic. That's a three-layer problem asking you to spot the greedy invariant, code bit operations cleanly, and trace through matrix state changes. Topics spread across array, string, and bit work, but the real challenge is connecting greedy choice to bitwise optimization. Study the medium hard. If you've drilled string matching and basic greedy, you're ahead. If bit manipulation still feels slippery, StealthCoder is your insurance during the actual assessment when time pressure hits.
Companies with similar patterns
If you prepped for IIT Bombay, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass IIT Bombay.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
IIT Bombay interview FAQ
Is two hours enough to solve both IIT Bombay problems?+
Time varies by experience. The easy string problem should take 10-15 minutes. The medium requires you to identify the greedy strategy and implement bit operations correctly, likely 25-40 minutes depending on how quickly you see the pattern. You have buffer, so focus on correctness over speed.
Should I study bit manipulation before the greedy problem?+
No. The greedy insight comes first: flipping rows then columns in a specific order minimizes score. Once you have that, bit operations are just the implementation detail. Drill greedy patterns, then practice bitwise AND/XOR operations on small matrices to build speed.
How much string-matching practice is enough for the easy problem?+
The easy problem appears to be a standard string-search variant. Practicing 5-10 two-pointer and string-matching problems should cover it. The KMP and simple indexOf patterns are most common. One easy problem won't sink your round, but don't skip it.
Does IIT Bombay test matrix problems often?+
Data is limited to 2 reported problems, and one is a matrix problem combining multiple skills. Matrix traversal, rotation, and bit-level operations show up here. If matrix work isn't in your regular rotation, add 3-4 matrix problems to your prep this week.
What's the biggest trap in the medium problem?+
Assuming brute force works. Many candidates try all row/column flip combinations. The greedy observation is critical: always flip to minimize the bit at the current position. Miss that and you'll code a slow solution. Identify the greedy invariant before writing code.