Problem database last updated: June 20, 2025
9 problems · 4 Easy, 5 Medium, 0 Hard · Ranked #161 of 458
4 Easy
44% · avg 23%
5 Medium
56% · avg 59%
0 Hard
0% · avg 18%
Based on 9 reported problems, ZS Associates interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (56%) 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, ZS Associates puts unusual emphasis on database (33.3% of problems, 29.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (55.6%), database (33.3%), string (22.2%), dynamic-programming (22.2%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Longest Harmonious Subsequence We define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1. | Easy | Very Likely | arrayhash-tablesliding-window | Solve |
Nth Highest Salary Table: Employee | Medium | Very Likely | database | Solve |
Crawler Log Folder The Leetcode file system keeps a log each time some user performs a change folder operation. | Easy | Very Likely | arraystringstack | Solve |
Managers with at Least 5 Direct Reports Table: Employee | Medium | Very Likely | database | Solve |
Largest 1-Bordered Square Given a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid that has all 1s on its border, or 0 if such a subgrid doesn't exist in... | Medium | Very Likely | arraydynamic-programmingmatrix | Solve |
Longest Unequal Adjacent Groups Subsequence I You are given a string array words and a binary array groups both of length n. | Easy | Very Likely | arraystringdynamic-programming | Solve |
The Number of Employees Which Report to Each Employee Table: Employees | Easy | Very Likely | database | Solve |
Product of Array Except Self Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. | Medium | Very Likely | arrayprefix-sum | Solve |
Distribute Candies Among Children II You are given two positive integers n and limit. | Medium | Very Likely | mathcombinatoricsenumeration | Solve |
Longest Harmonious Subsequence
SolveWe define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1.
Crawler Log Folder
SolveThe Leetcode file system keeps a log each time some user performs a change folder operation.
Largest 1-Bordered Square
SolveGiven a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid that has all 1s on its border, or 0 if such a subgrid doesn't exist in...
Longest Unequal Adjacent Groups Subsequence I
SolveYou are given a string array words and a binary array groups both of length n.
Product of Array Except Self
SolveGiven an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
Distribute Candies Among Children II
SolveYou are given two positive integers n and limit.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent ZS Associates interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
ZS Associates interviews focus heavily on array, database, string 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. ZS Associates 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.
ZS Associates has been reported to ask 9 distinct coding problems. The most common topics are array, database, string. 4 are Easy difficulty, 5 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 9 reported problems, ZS Associates interviews are easier than average - only 0% Hard compared to 18% across all companies. 56% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, database, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real ZS Associates coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a ZS Associates interview with AIarrow_forward
