INDmoney coding interview
questions, leaked.
2 problems reported across recent INDmoney interviews. Top patterns: tree, depth first search, binary tree. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
INDmoney's coding assessment is small but punchy. Two problems, both medium difficulty, zero filler. You're looking at a tree traversal problem paired with a streaming-data design challenge that hinges on monotonic-stack logic. The assessment expects clean pattern recognition under time pressure. If you freeze on either, StealthCoder runs invisibly during the live screen share and surfaces a working solution in seconds. That's your insurance policy.
Top problems at INDmoney
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Count Nodes Equal to Average of Subtree | MEDIUM | 100.0 | 86% | Tree · Depth-First Search · Binary Tree |
| 02 | Online Stock Span | MEDIUM | 100.0 | 67% | Stack · Design · Monotonic Stack |
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 INDmoney OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- tree1 · 50%
- depth first search1 · 50%
- binary tree1 · 50%
- stack1 · 50%
- design1 · 50%
- monotonic stack1 · 50%
- data stream1 · 50%
The problem set splits cleanly: one tree-and-DFS pattern, one stack-and-design pattern. Tree traversal and monotonic stacks are both high-velocity topics if you've drilled them, but they punish gaps hard. The monotonic-stack problem (Online Stock Span) is the trickier of the two because it combines state management with the stack trick itself. Your prep should front-load monotonic stacks and binary-tree DFS. If you hit a wall on either during the OA, StealthCoder is the real-time hedge. Most candidates won't have seen the exact span-calculation pattern cold, so expect that to be the decider.
Companies with similar patterns
If you prepped for INDmoney, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass INDmoney.
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 used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
INDmoney interview FAQ
Should I study trees or stacks first for INDmoney?+
Stack and monotonic-stack logic first. The tree problem (Count Nodes Equal to Average) is standard DFS you can drill in a day. The Stock Span problem demands both stack mechanics and state tracking, which is harder to improvise mid-interview. Monotonic stacks trip up prepared candidates.
Is two problems a short assessment?+
Yes. Both are medium difficulty and no easy-warm-up problem. INDmoney expects you to hit the ground running. Each problem likely gets 25 to 40 minutes depending on their time box. There's no room for slow starts.
What's the hardest part of the Stock Span problem?+
Tracking the span (days since a greater price) while managing the stack. It's not just implementing a monotonic stack; you're storing indices and computing lookback distances. Most candidates miss the index-storage detail and tank on submission.
Do I need to memorize the tree problem solution?+
No, but you should be able to code DFS subtree traversal and averaging logic without hesitation. The problem is the pattern, not the code. Practice that pattern on similar tree problems until it's muscle memory.
What if I blank on the monotonic-stack trick during the OA?+
StealthCoder solves it invisibly. The stack trick isn't intuitive; many candidates with solid algorithm skills haven't seen it before. If you hit that wall live, a working solution appears on your hidden overlay without proctor detection.