Swiggy | SDE 1 - Backend | Bangalore | September 2021 [Offer]
- Result
- Offer
- Location
- Bangalore
- Experience
- 1 year
- Posted
- 22 Sept 2021
Summary
I interviewed for an SDE1 Backend role at Swiggy in Bangalore during September 2021, and I successfully received an offer. The interview process was entirely virtual and spanned four rounds: an online assessment, a machine coding round, a data structures and algorithms round, and finally, a hiring manager discussion.
How it went
Application Process
I applied for the Swiggy SDE1 - Backend position in Bangalore through a referral. My professional background included over a year of experience as an SDE1 at a product-based company. The entire interview process took place virtually in September 2021.
Round 1: Online Assessment (1.5 hours)
This round was conducted on HackerRank. I successfully solved all three questions presented:
- A problem focused on determining the number of distinct subarrays that could be formed with at most a given number of odd elements.
- A question involving a number line from 0 to 'n' and a string of moves, where I needed to find the number of subsequences of moves that would lead from a given point 'x' to 'y'.
- A problem asking to select weights from a given list such that their sum did not exceed a specified capacity.
Two days after the online assessment, I received a call to proceed to the interview rounds.
Subsequent Rounds (Conducted on the same day)
Round 2: Machine Coding Round (3 hours)
The primary task was to design and code a multilevel parking lot system. Although I couldn't complete all the given requirements within the two-hour timeframe, the interviewer paid close attention to my design approach. We had a detailed discussion about my design choices and how I would implement the remaining features. Additionally, I was asked to code the Singleton design pattern, which led to a thorough discussion where I successfully answered all related questions.
Round 3: Data Structures and Algorithms (1 hour)
This round began with a brief discussion about the previous machine coding round. Following that, I was given a problem similar to LeetCode's Rotting Oranges. We explored numerous follow-up questions based on this problem.
Round 4: Hiring Manager Round (1 hour)
In this final round, we discussed a Data Structures & Algorithms question related to a parking lot system, though the specifics were not elaborated. The hiring manager also inquired about my current work responsibilities and asked me to explain one of my projects in detail.
I received the interview results approximately 4-5 days after the final round. I found the interviewers and HR team to be very friendly, and the overall interview process was remarkably smooth.
Questions asked (6)
- 01
Distinct Subarrays with At Most K Odd Elements
Data Structures & Algorithms
Determine number of distinct subarrays that can be formed having at most of given number of odd elements.
- 02
Number of Subsequences of Moves to Reach Target
Data Structures & Algorithms
Given a number line from 0 to n and a string denoting sequence of moves, determine the number of subsequence of those moves that lead from given point x to end at another point y.
- 03
Subset Sum with Capacity Limit
Data Structures & Algorithms
Given a list of weights select weights from the given list such that there sum does not exceed a given capacity.
- 04
Design Multilevel Parking Lot
System Design
Design and code a multilevel parking lot system. The interviewer looked into my design and asked about the design for remaining requirements.
- 05
Implement Singleton Design Pattern
Other · Easy
Implement the Singleton design pattern and discuss its implications and usage.
- 06
Rotting Oranges
Data Structures & Algorithms · Medium
Open the problemA problem similar to Rotting Oranges (LeetCode #994) was discussed, with a lot of follow-up questions based on it.