INDmoney Interview Experience SDE Intern (Off-Campus)
Last Updated :
23 Jul, 2025
Overview :
INDmoney was an off-campus opportunity where I got the call from recruiter enquiring about my internship experience and availability for 6 months Onsite and if I am interested for this opportunity. There after they scheduled my first round the very next day only.
There was no Online Assessment
Round 1 : Technical Interview
So, this was my first round and it began with interviewer introducing himself following my introduction. Then he directly moved to flow where he told me that they will first know about my experience, then some system architecture/ Core CS questions and then DSA part. He was very helpful and polite.
I explained my work and project I did in my old intern in detail. Then he asked me about Producer Consumer problem which I explained then he asked me to give real life analogy to which I didn't gave most appropriate example.
Then he asked me about the system architecture and APIs flow with methods for order placing system of e-commerce followed by some question based on REST APIs which I mentioned in my resume here I was not very proficient and he helped me figuring out some APIs.
Then he gave me a Problem in which we are given n people and m transactions between them. Each transaction represents an amount of money that one person owes to another. Your task is to minimize the number of transactions required to settle all debts so that no one owes anyone else in the end. I was quickly able to figure out it was graph problem with greedy in-out degree approach with some conditions then he discussed time and space complexities I was able to propose a O(m) solution, he asked me to reduce it to O(n) then after trying few approached i got to a logic where he said that he is not expecting a code which solves all testcases as this was a NP Hard problem and he asked me to code it. This was a fairly hard problem.
I coded this in 10-15 mins(Although he gave me 30 mins to do it) and then he asked me for the edge cases where I was able to figure out negative weighted cycles with his help. My code ran all other cases.
Then he asked me some questions related to ER-Model for student report card where i was not fully prepared but tried hard and some situation based questions like : How would you Cope up with fast environment, which code will you prefer you one or the correct one taking scalability as factor to which I answered my code solves 90% of the problem and for 10% other cases we will make case and apply bellman ford checking my exception handling skills.
The round was scheduled for 60 mins but lasted for about 90 mins.
Round 2 : Technical Interview with Director of Engineering
Next day I got a call from recruiter that I have been selected for next round with a positive response in round 1.
In second round the DOE directly greeted and moved to DBMS asking some questions like
- What is Indexing with detailed complexities(I mentioned in my resume)
- Where to use Indexing, logic behind it and where in real would you use it.
- Normalization
- A table to normalize which I was unable to do completely but again normalized 90% of the total(There were 3 tables in 3- NF)
- Then he asked me about how did you optimized API calls in your previous intern.
- Some basic GET POST methods
- Some API codes and uses like 200, 400, 500, 505(I missed 400 here in interview :( )
- He asked me to design APIs for adding two numbers.
- Variation on above situation if we want to get data from 3rd party through integration.
DSA Problem :
Given a binary tree, calculate the sum of the minimum distances between all pairs of nodes and return the total sum. Again can't find this in internet.
Variation of below but in binary tree pattern and no re routing allowed.
https://www.geeksforgeeks.org/dsa/sum-of-distances-of-all-nodes-from-a-given-node/
I began with a brute-force BFS to calculate the distance between every pair of nodes. This approach is inefficient due to high time complexity. And he did not allowed me re-routing in binary tree then I Optimized Approach using DFS with DP and LCA Used DFS to calculate and store the depth of each node in a DP array (dp[node]) to avoid redundant calculations. Calculate the Lowest Common Ancestor (LCA) for each pair of nodes, which enables efficient distance computation between nodes.
Except for the approach there was no feedback during coding and design based questions.
Then he asked me how much time will you take to code it to I said 15 mins to which he said I want a working code and just asked me to code it under 15 mins and I did it and then tested it on testcase he gave and worked well :).
Round went for 65-70 mins.
Round 3 : CTO Round Technical
Then recruiter called me for a final tech round with CTO on the next day. I prepared for this one for DBMS and other core things according feedback by recruiter.
So the round started with introduction CTO sir were really cool and humble. Then he asked me about my past work and gave me a mongoDB aggregation based problem and allowed using internet.
Next he asked me how comfortable are you with DSA and asked me to prove the time complexity to find distance b/w two nodes in a perfectly balanced binary tree which I did.
Finally he gave me a variation problem of spiral matrix and gave me 20 mins to code and run for testcase he gave and while debugging we had a talk about competitive programming in depth as I do cp from a long time which made things more lite and finally my code worked.
He also allowed to use macros and template for CP and shortcuts.
This concluded my 3rd round.
Verdict : Selected
(Next day I got a call from recruiter confirming my selection)
Suggestions :
- Don't lie in resume.
- Be confident with your approaches if there is no feedback.
- Ask clarifications questions.