Interview Experience | ZOHO | Software Developer
- Result
- Rejected
- Posted
- 14 Sept 2025
Summary
I recently interviewed at Zoho for a Software Developer role, which involved several technical rounds including aptitude, coding, and a final technical interview. Unfortunately, I was rejected after the last round.
How it went
I went through several rounds for a Software Developer position at Zoho.
Round 1: Aptitude & Programming
This round had 10 aptitude and 10 programming questions. The difficulty was generally easy to intermediate, and I found them solvable within the one-hour time limit.Round 2: Coding Questions
This was an intensive coding round lasting 3-4 hours, featuring 5-7 questions. I recall being asked about Chocolate Distribution, Diagonal Traversal, Group Anagrams, Meeting Room Allocation, and Word Pattern. Typically, solving 4 or 5 problems is sufficient to progress. The difficulty ranged from intermediate to hard.Round 3: Low-Level Design / Coding
Zoho usually focuses on Low-Level Design here, but in my case, they presented two hard-level matrix-based coding problems. I managed to solve both and successfully advanced to the next stage. This round took me about 2-3 hours.Round 4: Technical Interview
The final technical interview started with my self-introduction. I was then asked about the 3Sum problem, including its time complexity, how to traverse a 2D array without recursion (requiring logic implementation), and how to check if a Linked List is circular (again, writing the logic). We also discussed BFS vs DFS, both with and without recursion. Finally, there were several questions related to my projects, mainly focusing on code aspects. I felt I wasn't fully prepared for this round.Questions asked (9)
- 01
Chocolate Distribution Problem
Data Structures & Algorithms · Medium
Given N number of chocolates, where each chocolate has a different price/value, and M number of students, distribute M chocolates to M students such that the difference between the maximum and minimum price/value of chocolates given to students is minimum. Each student gets only one chocolate.
- 02
Diagonal Traversal of Matrix/Tree
Data Structures & Algorithms · Medium
Given a matrix or a binary tree, traverse its elements in a diagonal order.
- 03
Group Anagrams
Data Structures & Algorithms · Medium
Given an array of strings
strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. - 04
Meeting Room Allocation
Data Structures & Algorithms · Medium
Given an array of meeting time intervals
intervalswhereintervals[i] = [start_i, end_i], return the minimum number of conference rooms required. - 05
Word Pattern
Data Structures & Algorithms · Easy
Given a
patternand a strings, find ifsfollows the same pattern. Here 'follows' means a full match, such that there is a bijection between a letter inpatternand a non-empty word ins. - 06
3Sum Problem
Data Structures & Algorithms · Medium
Given an integer array
nums, return all the triplets[nums[i], nums[j], nums[k]]such thati != j,i != k, andj != k, andnums[i] + nums[j] + nums[k] == 0. The solution also requires discussion of its time complexity. - 07
2D Array Traversal Iteratively
Data Structures & Algorithms · Easy
Explain and write logic for traversing a 2D array without using recursion. This usually implies an iterative approach like row-major or column-major order.
- 08
Check if Linked List is Circular
Data Structures & Algorithms · Easy
Explain and write logic to determine if a given singly linked list contains a cycle (is circular).
- 09
BFS vs DFS Comparison
Data Structures & Algorithms · Easy
Compare Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms. Discuss their implementation details, including approaches with and without recursion, and their respective use cases and complexities.