Problem database last updated: June 20, 2025

ZZepto logo

Zepto Coding Interview Questions

31 problems · 1 Easy, 25 Medium, 5 Hard · Ranked #62 of 458

Difficulty breakdown

1 Easy

3% · avg 23%

25 Medium

81% · avg 59%

5 Hard

16% · avg 18%

Top topics

array
77.4%
depth-first-search
19.4%2.1x
hash-table
19.4%
dynamic-programming
19.4%
binary-search
16.1%1.8x
matrix
16.1%1.8x

Interview profile

Based on 31 reported problems, Zepto interviews are in line with industry averages - 16% Hard vs 18% overall. The majority (81%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.

Compared to the industry average, Zepto puts unusual emphasis on union-find (9.7% of problems, 3.3x the industry average), monotonic-stack (9.7% of problems, 3.3x the industry average), depth-first-search (19.4% of problems, 2.1x the industry average). If you're short on time, these are the categories to double down on.

The most common topics are array (77.4%), depth-first-search (19.4%), hash-table (19.4%), dynamic-programming (19.4%). Problems below are sorted by frequency, the ones at the top are asked most often.

All 31 problems

Longest Univalue Path

Solve

Given the root of a binary tree, return the length of the longest path, where each node in the path has the same value. This path may or may not pass through th...

MediumVery Likely
treedepth-first-searchbinary-tree

Merge Intervals

Solve

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...

MediumVery Likely
arraysorting

Path Sum III

Solve

Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum.

MediumVery Likely
treedepth-first-searchbinary-tree

Car Pooling

Solve

There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).

MediumVery Likely
arraysortingheap-priority-queue

Longest Consecutive Sequence

Solve

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

MediumVery Likely
arrayhash-tableunion-find

Find Peak Element

Solve

A peak element is an element that is strictly greater than its neighbors.

MediumVery Likely
arraybinary-search

Koko Eating Bananas

Solve

Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.

MediumVery Likely
arraybinary-search

Largest Rectangle in Histogram

Solve

Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his...

HardVery Likely
arraystackmonotonic-stack

Sliding Window Maximum

Solve

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...

HardVery Likely
arrayqueuesliding-window

Minimum Cost For Tickets

Solve

You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte...

MediumVery Likely
arraydynamic-programming

Unique Paths II

Solve

You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r...

MediumLikely
arraydynamic-programmingmatrix

Word Search

Solve

Given an m x n grid of characters board and a string word, return true if word exists in the grid.

MediumLikely
arraystringbacktracking

Number of Islands

Solve

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

MediumLikely
arraydepth-first-searchbreadth-first-search

Rotting Oranges

Solve

You are given an m x n grid where each cell can have one of three values:

MediumLikely
arraybreadth-first-searchmatrix

LRU Cache

Solve

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

MediumLikely
hash-tablelinked-listdesign

Search in Rotated Sorted Array

Solve

There is an integer array nums sorted in ascending order (with distinct values).

MediumLikely
arraybinary-search

Maximum Good Subarray Sum

Solve

You are given an array nums of length n and a positive integer k.

MediumLikely
arrayhash-tableprefix-sum

Find the Distance Value Between Two Arrays

Solve

Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays.

EasyLikely
arraytwo-pointersbinary-search

Gas Station

Solve

There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].

MediumLikely
arraygreedy

Open the Lock

Solve

You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely...

MediumLikely
arrayhash-tablestring

Longest Repeating Character Replacement

Solve

You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th...

MediumLikely
hash-tablestringsliding-window

Rabbits in Forest

Solve

There is a forest with an unknown number of rabbits. We asked n rabbits "How many other rabbits have the same color as you?" and collected the answers in an int...

MediumLikely
arrayhash-tablemath

Count Sub Islands

Solve

You are given two m x n binary matrices grid1 and grid2 containing only 0's (representing water) and 1's (representing land). An island is a group of 1's connec...

MediumLikely
arraydepth-first-searchbreadth-first-search

Trapping Rain Water

Solve

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

HardLikely
arraytwo-pointersdynamic-programming

Next Permutation

Solve

A permutation of an array of integers is an arrangement of its members into a sequence or linear order.

MediumLikely
arraytwo-pointers

Maximum Sum BST in Binary Tree

Solve

Given a binary tree root, return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST).

HardLikely
dynamic-programmingtreedepth-first-search

Longest Palindromic Substring

Solve

Given a string s, return the longest palindromic substring in s.

MediumLikely
two-pointersstringdynamic-programming

Maximum Width Ramp

Solve

A ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j]. The width of such a ramp is j - i.

MediumLikely
arraytwo-pointersstack

Jump Game II

Solve

You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.

MediumLikely
arraydynamic-programminggreedy

Divide Two Integers

Solve

Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.

MediumLikely
mathbit-manipulation

Make Array Empty

Solve

You are given an integer array nums containing distinct numbers, and you can perform the following operations until the array is empty:

HardLikely
arraybinary-searchgreedy

How often are these problems asked?

Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Zepto interviews.

Very Likely

75-100%

Likely

50-74%

Sometimes

25-49%

Rare

0-24%

Preparing for your Zepto coding interview

Zepto interviews focus heavily on array, depth-first-search, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.

Beyond solving problems, practice explaining your approach. Zepto interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.

Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.

Frequently Asked Questions

What coding problems does Zepto ask in interviews?add

Zepto has been reported to ask 31 distinct coding problems. The most common topics are array, depth-first-search, hash-table. 1 are Easy difficulty, 25 are Medium, and 5 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.

How hard are Zepto coding interviews?add

Based on 31 reported problems, Zepto interviews are in line with industry averages - 16% Hard vs 18% overall. 81% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.

How should I prepare for a Zepto coding interview?add

Start with the highest-frequency problems listed on this page. Focus on the core topics: array, depth-first-search, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.

Other companies to explore

Ready to ace your Zepto interview?

Simulate a real Zepto coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.

Simulate a Zepto interview with AIarrow_forward