Applied through Swiggy Careers.
Number of rounds – 4
Round 1 – Online Assessment
It was a Hackerrank test, consisting of 3 questions to be solved in 1.5 hrs. Was able solve all of them.
- Heap based question. (Min Heap version of a very famous question)
- LIS variation.
- Tree Based question. (need Union Find algo to solve it) (Later found this question leetcode interview questions section as well)
After Few days, HR called told I got selected for next round.
Round 2 – Machine Coding (2 Hr)
Was Asked to design splitwise app, with only EXACT & EQUAL Split. Took 2 hrs to code it & wrote test cases to demo application. Interviewer took 30 more mins asking few system design related questions.
This round lasted for 150 mins.
After Few days, HR called told I got selected for next round.
Round 3 – PS/DS (1 Hr)
In this round, interviewer gave me the question:
- LC Easy: BST based question. Given a Target, find nearest node value present in Tree.
- LC Easy: Given a string, a source array, target array and index array, replace index[i]th from substrng from given string, if substring of given string matches source[i] to target[i]. Else ignore.
This round completed within 45 mins.
After Few days, HR called told I got selected for next round.
Round 4 – LLD Round(1 Hr)
Basic introductions, I have explained my past experience & projects. Then he asked to design a service for showing HeatMap of Swiggy agents at a time. This where f'ed up the most. I fumbled a lot & asked a lot of questions, didn't knew geolocation related jargons & what they meant. I have proposed a naive solution & the interviewer got a sense where I was going.
Got rejection same day.
Requesting leetcode folks, to help how this LLD question would have been solved in a better way.