ZUPEE | SDE-1 | Fresher | Gurugram | April-2024 | [SELECTED]

zupee logo
zupee
SDE-1GurugramOffer
August 13, 202426 reads

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.

Full Experience

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).

Interview Questions (6)

Q1
Search in Rotated Sorted Array
Data Structures & AlgorithmsMedium

I was presented with the standard 'Search in Rotated Sorted Array' problem from LeetCode.

Q2
Partition Equal Subset Sum
Data Structures & AlgorithmsMedium

I was asked to solve the 'Partition Equal Subset Sum' problem.

Q3
Coding Problem based on Kadane's Algorithm
Data Structures & AlgorithmsMedium

I solved a medium-level coding problem that required the application of Kadane's Algorithm to find the maximum sum subarray.

Q4
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.

Q5
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.

Q6
LRU Cache Implementation
Data Structures & AlgorithmsMedium

I was tasked with implementing an LRU (Least Recently Used) cache from scratch, covering its design and underlying data structures.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!