Zepto Interview Experience

zepto logo
zepto
4 years
April 9, 20258 reads

Summary

I interviewed at Zepto for a role (likely SDE) and went through multiple rounds including DSA, Design (LLD & HLD), Hiring Manager, and HR. Although I successfully solved the DSA questions and one design problem, I was ultimately rejected.

Full Experience

DSA Rounds:

https://leetcode.com/problems/container-with-most-water/

https://leetcode.com/problems/word-ladder/description/

✅ Successfully solved both questions during the interview.

Design (LLD) & HLD:
Coupon Creation Service

  1. Designed DB schema and system for different coupon types: percentage off, flat off, discount, cashback, etc.

Interviewer was not fully convinced by the approach

  1. Frequency-Based Coupon Selection (every 1-minute window):

Given a list of coupons with frequency, designed a system to randomly select coupons based on frequency.

Proposed an asynchronous job-based approach to pre-generate coupon IDs and do matching.

Interviewer was convinced and satisfied with this solution.

Hiring Manager Round:

Resume-based discussion

Talked about past project challenges

Solved LCA in Binary Tree

HM was approachable, calm, friendly—overall good interaction and some casual conversations as well.

HR Round:
General discussion and behavioral questions.

However, no updates from HR despite multiple follow-ups over the past week.

Eventually found out: Rejected

Interview Questions (5)

Q1
Container With Most Water
Data Structures & Algorithms

Refer to the provided LeetCode link for the full problem description.

Q2
Word Ladder
Data Structures & Algorithms

Refer to the provided LeetCode link for the full problem description.

Q3
Coupon Creation Service - LLD/HLD
System Design

Designed DB schema and system for different coupon types: percentage off, flat off, discount, cashback, etc.

Q4
Frequency-Based Coupon Selection System
System Design

Given a list of coupons with frequency, designed a system to randomly select coupons based on frequency.

Q5
Lowest Common Ancestor of a Binary Tree
Data Structures & Algorithms

The problem asks to find the Lowest Common Ancestor (LCA) of two given nodes in a binary tree.

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!