Applied through Swiggy Careers.
Number of rounds – 4
Round 1 – Online Assessment
It was a Hackerrank test, consisting of 4 questions to be solved in 1.5 hrs. Was able to solve 2 completely, 1 almost 90 % test cases, & couldn't able to attempt the last. Got selected for next rounds.
Round 2 – LLD Round
The interviewer quickly shared a google doc & asked to design a bill splitting app (splitwise). This round was for 60 mins. I told the Design requirements, when he's okay with it, I started schema design explaining my approach & he was agreeing to me. Then after he asked me to design few CRUD APIs and asked me to write Request/Response structures. In the last 20 mins, he gave me a extra requirement which I did in a unoptimised way later did it optimally with help of a hint. In last 5 mins, I introduced about myself & asked few questions about Swiggy culture.
After 2 weeks I get a call from the recruiter saying I got selected for further rounds, & will be having 2 PS/DS rounds back to back.
Round 3 – PS/DS
In this round, interviewer gave me the question:
- Given a number find all greater numbers formed by the digits. For ex: input 213, output: 231, 312, 321
I recognised it is LC medium question + recursion, hence started explaining my approach with bruteforce solution to optimal solution, and the coded the same. The interviewer was testing on various inputs whether my code fails or not, I saw few bugs in my code, & corrected them. It took almost 50 mins, then we discussed about my past work & experience.
This round lasted for 60 mins.
Round 4 – PS/DS
In this round, interviewer gave me the question:
- Given n postboxes at each kilometer, there are m queries x, y, l. Put l posts in all postboxes that exists between xth km & yth km. Give the maximum postbox with the highest posts.
I clarified few doubts & gave a brutforce solution with a TC of O(mXn). But the interviewer was expecting a TC of O(m+n). Couldn't able to come up with the approach within the time.
This round lasted for 60 mins.
Verdict – Rejected.