i
Zepto
Filter interviews by
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
Top trending discussions
I applied via campus placement at Maulana Azad National Institute of Technology (NIT), Bhopal and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
Create a pagination component using an API to display data for different pages.
Use API to fetch data for each page
Implement pagination logic to display data for each page
Allow users to navigate between pages
posted on 26 Aug 2024
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
So after Resume shortlisting you have Round 1 as Programming Test (60%) & Aptitude Test (40%) in which you will be asked 15 aptitude questions and 2 DSA problems. You will get 1 hour to write the test.
DSA problems:
1. Merge 2 sorted arrays
2. find the target sum in given array and return their indexes
Find the length of the longest substring with distinct characters in a given string.
Use a sliding window approach to keep track of the current substring.
Maintain a set to store the distinct characters in the current substring.
Update the maximum length of the substring whenever a longer substring is found.
The maximum sum of a subarray is to be found.
Use Kadane's algorithm to find the maximum sum of a subarray.
Initialize two variables: maxSum and currentSum.
Iterate through the array and update currentSum by adding the current element.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
Return maxSum as the maximum sum of a subarray.
1 Interview rounds
based on 2 reviews
Rating in categories
Shift Incharge
371
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Team Lead
129
salaries
| ₹2 L/yr - ₹8 L/yr |
Store Manager
126
salaries
| ₹2.2 L/yr - ₹8.5 L/yr |
Senior Manager
118
salaries
| ₹10 L/yr - ₹30 L/yr |
Store Incharge
90
salaries
| ₹2.3 L/yr - ₹4.5 L/yr |
Blinkit
Dunzo
BigBasket
Swiggy