Current role: A backend developer with 2+ years of experience in a fintech company.
Position Interviewed for: Swiggy SDE2
Location: Bangalore (Interviews were completely virtual)
Month: January 2022
Application Process:
Applied through swiggy career page.
Round 1: (Online coding)
Conducted in Hackerrank
Duration: 1.5 hrs
3 questions were there. 2 were LC medium and 1 LC was hard. I dont remember the exact questions.
First one was simple sorting. ( Variation of Best time to buy stock)
Second one was a variation of union find algorithm.
Third one was a variation of https://leetcode.com/problems/maximum-profit-in-job-scheduling/.
The first 2 questions were not that tough and I was able to complete both of them but I wasn't able to pass all the test cases of the 3rd questions.
After a week, I got a call that I have cleared OA.
Round 2: (Machine coding round)
Duration: 2 hours
I was asked to design splitwise application. You can use any IDE.
An interviewer was available. But I was told to just discuss an initial design and then start on the implimentation acitivty straightaway.
At the end of 1 hours 45 min, the interviewer gave me some test cases to execute and I was asked to explain the overall design of the code.
My code had some initial problems but I was able to fix those issues and the test cases passed.
The code should be working and be very precise in using OOD principles.
I was told by HR on the same day that I cleared this round.
Round 3 – PS/DS
I was asked to solve 2 DS questions. It was a 1 hour round,
Question 1: Find the maximum gain in a two-players game where a circular array is given and each player in turn is allowed to pick one element from either end of the array. The goal of each player is to score more than his opponent. Does the player who plays first always win?
I was able to solve this question and wrote a working code. Was asked to explain the time complexity as well.
Question 2: https://leetcode.com/problems/palindrome-pairs/
I wasn't able to come with a complete solution on my own. But after few discussions, we came up with an optimised approach using tries. But much since time was not left, we just discussed approach and time complexities.
I was told by HR on the same day that I cleared this round.
Round 4 – LLD
It was taken by a senior developer. I was asked to do a LLD in 1 hour for the following:
The interviewer showed me the swiggy application and basically asked me to write api's and LLD for the filters generated ( both visible by default and those generated on demand) for the swiggy application.
The interviewer was very helpful and gave me enough hints during the whole process. I was able to come up with basic api's and explained my thought process for it. Due to time contraints, we couldn't discuss low level classes but I gave some ideas on how I plan to do it.
A suggestion will be to try to speak out your mind and don't hesitate to ask for hints if you get stuck.
I was told by HR on the same day that I have cleared this round.
Round 5 – Hiring Manager round
This round was taken by an engineering manager at swiggy. He started off by explaining the team I was interviewing for and what all are the responsibilities of this team. Then he asked me to do an LLD for a chess game. Primarily entity relationship between various aspects of the game. Then he asked me some behaviorial questions like what all technologies I was working in my previous companies, working style, challenges faced and some other questions.
The interviewer was super nice and friendly and he answered many of my questions quite elaborately.
I got a feedback on the same day that I have been selected. The follow up HR discussion happened after 4 days and then after a week, the offer was shared with me.
The overall experience of swiggy was very smooth and positive and the HR and the interviewer's were really helpful at every stage of the interview process.
The leetcode community has really helped me to preprare for interviews and I hope my experience helps you all prepare well for swiggy. I will be happy to answer any questions you may have.