ZUPEE | SDE-1 | Fresher | Gurugram | April-2024 | [SELECTED]
- Result
- Offer
- Location
- Gurugram
- Posted
- 13 Aug 2024
Summary
I interviewed for the SDE-1 role at Zupee in Gurugram and received an offer. The process involved three rounds covering DSA, Kadane's algorithm, DBMS, projects, and LRU cache implementation.
How it went
I applied for the SDE-1 position at Zupee through LinkedIn. My background includes education from a Tier-1 college and a 2-month summer internship at a product-based company. The interview process consisted of three rounds.
In Round 1, I was given two medium-level Data Structures and Algorithms problems. The first problem was 'Search in Rotated Sorted Array' and the second was 'Partition Equal Subset Sum'.
Round 2 involved another medium coding problem based on Kadane's Algorithm. Additionally, there were questions on Database Management Systems, specifically focusing on Joins and Indexing.
Round 3 was a brief discussion about my projects and I was asked to implement an LRU cache.
Ultimately, I received a 'Select' verdict for the role with a CTC of 21L (16L fixed, 1L variable, plus 4L ESOPs).
Questions asked (6)
- 01
Search in Rotated Sorted Array
Data Structures & Algorithms · Medium
Open the problemI was presented with the standard 'Search in Rotated Sorted Array' problem from LeetCode.
- 02
Partition Equal Subset Sum
Data Structures & Algorithms · Medium
Open the problemI was asked to solve the 'Partition Equal Subset Sum' problem.
- 03
Coding Problem based on Kadane's Algorithm
Data Structures & Algorithms · Medium
I solved a medium-level coding problem that required the application of Kadane's Algorithm to find the maximum sum subarray.
- 04
DBMS: Joins and Indexing
Other
I had a discussion about Database Management Systems, specifically covering concepts like various types of Joins and different indexing strategies.
- 05
Projects Discussion
Other
I engaged in a detailed discussion about the projects I had listed on my resume, explaining their architecture, my contributions, and the technologies used.
- 06
LRU Cache Implementation
Data Structures & Algorithms · Medium
I was tasked with implementing an LRU (Least Recently Used) cache from scratch, covering its design and underlying data structures.