i
Zepto
Filter interviews by
I appeared for an interview in Sep 2024.
Calculate sum of large numeric comma separated strings without converting to integers.
Split the strings by comma to get individual numbers
Iterate from right to left and add digits, carrying over if necessary
Maintain correct position of commas in the output string
I have taken various initiatives in my career to improve processes and drive innovation.
Led a team to implement a new agile development process, resulting in faster delivery of products
Introduced automated testing tools to improve software quality and reduce manual effort
Organized coding workshops for junior developers to enhance their skills and knowledge
Initiated a mentorship program to help new hires acclimate to th
I own 5 microservices that handle traffic at a scale of 10,000 requests per minute.
I own 5 microservices
They handle traffic at a scale of 10,000 requests per minute
I have consistently gone above and beyond in my work by taking on additional projects and working extra hours when needed.
Volunteering to lead a high-priority project that required long hours and weekend work
Staying late to troubleshoot and resolve a critical issue before a major deadline
Taking on extra tasks to help a team member who was overwhelmed with their workload
Seeking new challenges and growth opportunities.
Desire for career advancement
Looking for new challenges
Seeking better work-life balance
Company restructuring or changes in management
Q1: leetcode medium q2 leetcode medium both array based
Design the low level design for Zepto system
Identify the components of the Zepto system such as user interface, database, backend services, etc.
Define the interactions between the components and how data flows through the system
Consider scalability, performance, and security aspects in the design
Use appropriate design patterns and technologies to implement the system
Include error handling and logging mechanisms in the
posted on 20 Jun 2024
I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.
1. Frogs Jump Question: FInd the minimum no of hops to reach the last index
2. Missing Element in a sorted array. If size is n. It contains elements from 1 to n+1. Do it in logn
Zepto interview questions for designations
What people are saying about Zepto
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
Basic React JS clock/ stopwatch
I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.
2 coding question one on maximum sum problem and other on tree traversal
I appeared for an interview in Dec 2021.
Round duration - 60 Minutes
Round difficulty - Medium
It has 3 Coding Questions of medium-hard level and the time limit was 1 hour only. I don’t exactly remember the questions but I was able to do only two of them completely.
Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.
Integer T denoting the nu...
Construct the largest number by concatenating positive integers in the array exactly once.
Sort the array of integers in a way that the concatenation of the numbers forms the largest possible number.
Use a custom comparator function to sort the numbers based on their concatenated values.
Join the sorted array elements to form the final largest number.
Given an integer array ARR
of length N
, determine the count of longest increasing subsequences present in the array.
The Longest I...
Count the number of longest increasing subsequences in an integer array.
Identify the longest increasing subsequences in the array
Count the number of such subsequences
Consider the constraints while implementing the solution
Examples: For input [50, 3, 90, 60, 80], the output is 2
Round duration - 60 Minutes
Round difficulty - Medium
First, the interviewer introduced himself and then asked to introduce myself. Then he asked about the projects I did. After an introductory discussion on projects, he gave me 3 coding questions on their personal live code environment.
He asked me to explain the approach first and then code it down. I had to explain the time complexity of each solution and optimal code if possible with lesser time complexity.
You are provided with a cache that can hold a maximum of 'N' elements. Initially, this cache is empty. There are two main operations you can perform on this cache:
Implement a cache with insert, update, and retrieve operations, returning results of retrieve operations in order.
Create a cache data structure with specified size 'N'.
Implement insert and update operations based on the given criteria.
For retrieve operation, return the value associated with the 'U_ID' if present, else return -1.
Handle cases where the cache is full and least frequently used items need to be removed.
Retu...
Given a string S
composed of digits ranging from 2 to 9, determine all possible strings that can be created by mapping these digits to their correspon...
Given a phone number, generate all possible words by mapping digits to letters on a T9 keypad.
Create a mapping of digits to letters on a T9 keypad
Use recursion to generate all possible combinations of letters for the given phone number
Sort the resulting strings in lexicographical order
You are given an array containing N
words. Your task is to derive the shortest prefix for each word that uniquely identifies it amongst the other words. For instance, given t...
Given an array of words, find the shortest unique prefix for each word.
Create a Trie data structure to efficiently store and search for prefixes.
Traverse the Trie to find the shortest unique prefix for each word.
Return the list of shortest unique prefixes for all words.
Round duration - 60 Minutes
Round difficulty - Hard
In this round interviewer gave me 2 coding questions and asked me to code on any editor of my choice. I opened VS code to code those problems.
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
Iterate through the array and keep track of the maximum sum subarray seen so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Handle cases where all elements are negative by returning the maximum element in the array.
Consider the sum of an empty subarray as 0.
Design and implement a data structure for the Least Recently Used (LRU) cache, which supports the following operations:
1. get(key) - Return the value associated with the key if ...
Implement a Least Recently Used (LRU) cache data structure with get and put operations.
Use a combination of a hashmap and a doubly linked list to efficiently implement the LRU cache.
Keep track of the least recently used item and remove it when the cache reaches its capacity.
Update the position of an item in the cache whenever it is accessed or updated.
Ensure constant time complexity for both get and put operations by u...
Round duration - 40 Minutes
Round difficulty - Easy
The interviewer was very friendly. He asked me about myself and previous interviews.
Tip 1 : Do at least 2-3 Development Projects as it creates a great impression.
Tip 2 : Do it simply don't include complex terms to explain anything/concept.
Tip 3 : Practice as many questions as you can.
Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.
I appeared for an interview in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
There were a total of 3 coding questions to be solved, and the time limit was 90 minutes. The candidate was free to use language of their choice.
Given a string A
consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A
.
The task is to find the length of the longest palindromic subsequence in a given string.
A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters.
A string is said to be palindrome if the reverse of the string is the same as the actual string.
Find the longest palindromic subsequence by considering all possible subs...
Round duration - 45 minutes
Round difficulty - Easy
The first round of interview lasted for around 45 minutes. I was asked two DSA questions, and was supposed to code them while my screen was shared. I wrote code for both the questions with little help from the interviewer. Finally, I was asked couple of questions based on my resume.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...The task is to merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged list
Compare the values of the nodes from both lists and add the smaller value to the new list
Move the pointer of the list with the smaller value to the next node
Repeat the comparison and addition until one of the lists is empty
Add the remaining nodes from the non-empty list to the new list
Return th
Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...
The task is to check if one string can be converted into another string by cyclically rotating it to the right any number of times.
Iterate through each character of the first string and check if it matches the corresponding character in the second string after a certain number of cyclic rotations.
If all characters match for any number of cyclic rotations, then the first string can be converted into the second string.
Us...
Round duration - 30 minutes
Round difficulty - Medium
I was given one data structure question and was then asked about recursion.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of the elements
For each element, pop elements from the stack until a greater element is found or the stack is empty
If a greater element is found, it is the next greater element for the current element
If the stack becomes empty, there is no greater element to the right
Store the ...
Round duration - 40 minutes
Round difficulty - Easy
This was the hiring manager round. No data structures question were asked in this round. There was discussion around the projects that I had done and my resume. As I am from EEE branch, I was asked why I want to get into software. The interview happened around 8 PM. I was asked to create a schema for one of my projects.
I want to get into software because of my passion for problem-solving and the opportunity to create innovative solutions.
Passion for problem-solving
Opportunity to create innovative solutions
Interest in technology and its impact on society
Career growth and job stability
Flexibility and remote work options
Tip 1 : Practice regularly, meaning once you have covered all the topics, revisit them every week, and solve 3-5 questions.
Tip 2 : Use the Feynman technique. Explain your approach towards solving the problem to someone, or better yet, note it down so that when you revisit that question, the explanation is handy.
Tip 3 : Do 1 project, preferably a full-stack one including a database. This would provide some material for discussion, and be through with each aspect of the project.
Tip 1 : Keep the resume to one page and put info that is directly related to the role applied.
Tip 2 : In the projects section, keep a maximum of 3 projects, but ensure that at least one of them is hosted/live that can be shown to the interviewer.
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
based on 5 interviews
Interview experience
based on 1 review
Rating in categories
Shift Incharge
416
salaries
| ₹2.2 L/yr - ₹4.8 L/yr |
Store Manager
162
salaries
| ₹3 L/yr - ₹8.5 L/yr |
Team Lead
150
salaries
| ₹2 L/yr - ₹8.4 L/yr |
Senior Manager
133
salaries
| ₹10 L/yr - ₹31 L/yr |
Delivery Boy
105
salaries
| ₹0.6 L/yr - ₹6 L/yr |
Blinkit
Dunzo
BigBasket
Swiggy