i
Zepto
Filter interviews by
Clear (1)
Deep copy is a copy of an object that duplicates all of its attributes, including nested objects, rather than just copying references.
Deep copy creates a new object with its own unique memory space.
Changes made to the original object do not affect the deep copy.
Deep copy is often used when you need to modify an object without affecting the original.
Example: Using JSON.parse(JSON.stringify(object)) in JavaScript to crea
I applied via Approached by Company and was interviewed in May 2024. There were 2 interview rounds.
1 hr coding round required me to solve 2 leetcode medium questions
Design an online grocery store similar to zepto.
Implement user-friendly interface for easy navigation
Include search functionality for quick product discovery
Offer secure payment options for customer convenience
Provide delivery options with tracking feature
Include customer reviews and ratings for products
Implement inventory management system for real-time updates
I applied via Referral and was interviewed in Jun 2024. There was 1 interview round.
It was a DSA round with one medium and one hard question.
I applied via Approached by Company and was interviewed in Apr 2024. There was 1 interview round.
2 leetcode medium question in 1 hr
Zepto interview questions for designations
What people are saying about Zepto
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I was interviewed in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
based on 4 interviews
1 Interview rounds
based on 2 reviews
Rating in categories
Shift Incharge
403
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
144
salaries
| ₹0 L/yr - ₹0 L/yr |
Store Manager
137
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
129
salaries
| ₹0 L/yr - ₹0 L/yr |
Store Incharge
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Blinkit
Dunzo
BigBasket
Swiggy