Zoho Previous Year Coding Questions and Hiring Process
Zoho is one of the most distinctive companies to interview with in India. Instead of outsourcing to a standard vendor test like AMCAT or CoCubes, Zoho runs its own in house written test and is widely known for not filtering hard on CGPA or college tier. It hires large numbers of freshers every year for its Software Developer roles, separate from the Zoho Schools of Learning track for 12th pass students.
If you are preparing for Zoho, understanding the written test format, the mini project style coding rounds, and the multiple technical interviews will help you prepare efficiently. This guide covers the complete Zoho hiring process along with previous year coding questions asked in its written tests and coding rounds.
Zoho Hiring Process
Here is the typical flow for Zoho fresher hiring through campus and off campus drives. The exact number of rounds varies a little between candidates, generally five to seven stages, often spread across a long single day or two consecutive days at a Zoho campus.
| Stage | What Happens | What They Are Looking For |
|---|---|---|
| A pen and paper test, around 90 minutes, split between aptitude and puzzle questions and guess the output C or Java code snippets. Answers are written directly, not chosen from options. | Logical thinking and careful reading of code. |
| Three to six standalone DSA, string, or array problems solved in a compiler over one and a half to three hours. | Working, correct code rather than just logic on paper. |
| A mini project style task, such as building a taxi booking module or an invoice management system with a working database schema, over two to three hours. | Clean OOP design, database thinking, and modular code. |
| One or two face to face rounds where the panel reviews your earlier code and design choices in depth, alongside core CS fundamentals. | Ability to explain and defend your own design decisions. |
| One or two rounds covering background, motivation for joining Zoho, salary expectations, and sometimes general awareness or scenario questions. | Communication, genuine interest, and cultural fit. |
Zoho is known for a steep drop off rate across the pipeline, with some candidates reporting only a few percent of the initial written test attendees receiving an offer, so treat every round as equally important rather than assuming later rounds are easier.
Assessment Pattern
Format: An offline, pen and paper written test rather than a computer based MCQ platform. Answers to the programming section are written as exact output, not selected from choices.
Sections typically included:
- Aptitude and Puzzles: Averages, ratios, time and work, profit and loss, speed and distance, alligation, plus logic puzzles.
- Guess the Output: C or Java code snippets testing pointers, arrays, strings, loops, and recursion, where you must predict the exact printed output.
Zoho Coding Rounds: What to Expect
Zoho's coding rounds are split into two distinct styles, and both matter for your preparation.
Basic coding round topics:
- String manipulation, encoding, and decoding problems
- Array sorting and pattern based problems
- Recursion based string and number problems
- Linked list and matrix based problems
- Classic problems such as Dutch National Flag sorting or Excel column naming
Advanced or mini project round: Instead of another isolated DSA problem, Zoho often gives a small real world module to build end to end, such as a taxi booking system, an invoice management system with a database schema, or a mini e-commerce store with inventory and order modules. This round tests object oriented design and database thinking, not just correctness.
For hands on practice, use:
Technical Interview Focus Areas
- Operating Systems: Deadlock, thrashing, virtual memory, kernel basics, multitasking, caching, process versus thread, paging versus segmentation.
- Computer Networks: HTTPS, VPN, digital signatures, authentication versus authorization, DNS, SMTP, LAN basics, network topologies.
- DBMS: Super, primary, candidate, and foreign keys, ER modelling, SQL joins, CHAR versus VARCHAR2, SQL versus NoSQL, denormalization, SQL injection.
- Project Discussion: Be ready to explain your resume project in real depth, including database schema, session management, and the full request flow.
- System Design Basics: Simple low level and high level design questions such as a railway reservation system or an employee management system.
HR Interview Tips
The HR and managerial rounds check communication, motivation, and overall fit. Common questions include:
- Tell me about yourself and your family background.
- Why do you want to join Zoho specifically.
- What are your strengths and weaknesses.
- What salary do you expect.
- How long do you plan to stay with the company.
- General awareness questions, such as what machine learning is or how a tool like ChatGPT compares to a search engine.
Complete HR Interview Questions
Answer with specific examples from your projects rather than generic statements, and stay calm if the panel asks you to defend a design choice from an earlier round.
Resources to Prepare for Zoho
- Free Aptitude Mock Practice latest patterns and mock tests
- ATS Score Checker and Resume Optimizer
- Roadmaps
- Interview Questions
- Resume Templates
- Free Placement Materials (Google Drive)
- Interview Experience
Zoho Previous Year Coding Questions
Below is a list of Zoho previous year coding questions commonly reported by candidates in the basic and advanced coding rounds. Each question includes a problem statement, input and output format, and a sample explanation.
1. Expand a Run Length Encoded String
Problem Statement:
Given a run length encoded string such as a1b10, expand it into the full string where each character is repeated the number of times specified after it.
Input Format:
- A string
scontaining letters followed by numbers
Output Format:
- The expanded string
Example:
Input: a1b3
Output: abbb
2. Sort by Position Parity
Problem Statement: Given an array, sort the elements at odd positions in descending order and the elements at even positions in ascending order, keeping each group in its original positions.
Input Format:
- An integer array
arr
Output Format:
- The rearranged array
Example:
Input: [5, 3, 8, 1, 9, 2]
Output: [9, 1, 5, 2, 3, 3]
3. Print a Diamond Pattern From a String
Problem Statement: Given a string, print a diamond shaped pattern using its characters, one character wider on each line until the middle, then narrowing back down.
Input Format:
- A string
s
Output Format:
- The diamond pattern printed line by line
Example:
Input: abc
Output:
a
ab
abc
ab
a
4. Find the First Occurrence of a Substring
Problem Statement: Given a string and a pattern, find the index of the first occurrence of the pattern in the string, or return -1 if it does not appear.
Input Format:
- A string
textand a stringpattern
Output Format:
- The starting index, or
-1
Example:
Input: text = "hello world", pattern = "world"
Output: 6
5. Merge Two Sorted Arrays Without Duplicates
Problem Statement: Given two sorted arrays, merge them into a single sorted array while removing duplicate values.
Input Format:
- Two sorted integer arrays
arr1andarr2
Output Format:
- The merged, deduplicated, sorted array
Example:
Input: arr1 = [1, 3, 5], arr2 = [3, 5, 7]
Output: [1, 3, 5, 7]
6. Reverse Words in a String Using Recursion
Problem Statement: Given a sentence, reverse the order of its words using recursion, keeping the letters within each word unchanged.
Input Format:
- A string
s
Output Format:
- The sentence with word order reversed
Example:
Input: I love coding
Output: coding love I
7. Fibonacci Spiral Matrix
Problem Statement: Given the dimensions of a matrix, fill it with consecutive Fibonacci numbers in spiral order starting from the top left corner.
Input Format:
- Two integers
nandmrepresenting rows and columns
Output Format:
- The filled matrix
Example:
Input: n = 2, m = 2
Output: [[0, 1], [2, 1]]
8. Decode a Nested Encoded String
Problem Statement:
Given an encoded string such as 3[a2[bc]], decode it by repeating each bracketed group the specified number of times.
Input Format:
- An encoded string
s
Output Format:
- The decoded string
Example:
Input: 3[a2[bc]]
Output: abcbcabcbcabcbc
9. Topological Sort of a Graph
Problem Statement: Given a directed acyclic graph, return a valid topological ordering of its nodes using Kahn's algorithm.
Input Format:
- A list of directed edges
Output Format:
- A valid topological order of the nodes
Example:
Input: edges = [[1,2],[1,3],[2,4],[3,4]]
Output: [1, 2, 3, 4]
10. Sort an Array of 0s, 1s, and 2s
Problem Statement: Given an array containing only 0s, 1s, and 2s, sort it in a single pass without using extra space, also known as the Dutch National Flag problem.
Input Format:
- An integer array
arrcontaining only 0, 1, and 2
Output Format:
- The sorted array
Example:
Input: [2, 0, 1, 2, 1, 0]
Output: [0, 0, 1, 1, 2, 2]
11. Excel Column Name From a Number
Problem Statement: Given a positive integer, return its corresponding Excel style column title, similar to how numbers map to A, B, C, up to Z, then AA, AB, and so on.
Input Format:
- An integer
n
Output Format:
- The column title string
Example:
Input: 28
Output: AB
12. Number of Good Pairs
Problem Statement:
Given an array of integers, count the number of pairs (i, j) where i < j and the elements at those indices are equal.
Input Format:
- An integer array
arr
Output Format:
- The count of good pairs
Example:
Input: [1, 2, 3, 1, 1, 3]
Output: 4
13. LRU Cache Implementation
Problem Statement: Implement a Least Recently Used cache that supports get and put operations with a fixed capacity, evicting the least recently used item when full.
Input Format:
- A sequence of get and put operations with a fixed capacity
Output Format:
- The result of each get operation
Example:
Input: capacity = 2, put(1,1), put(2,2), get(1), put(3,3), get(2)
Output: 1, -1
14. Count Descendants at a Given Level
Problem Statement: Given a family tree represented as parent child pairs, and a starting person and a level, count how many descendants that person has at exactly that level.
Input Format:
- A list of parent child pairs, a starting person, and an integer level
Output Format:
- The count of descendants at that level
Example:
Input: edges = [(A,B),(A,C),(B,D)], start = A, level = 2
Output: 1
15. Frequency of Each Element in an Array
Problem Statement: Given an array of integers, print the frequency of each distinct element.
Input Format:
- An integer array
arr
Output Format:
- Each distinct element with its frequency
Example:
Input: [1, 2, 2, 3, 1, 1]
Output: 1: 3, 2: 2, 3: 1
16. Elements Greater Than All Previous Elements
Problem Statement: Given an array, print all elements that are strictly greater than every element before them, in a single pass.
Input Format:
- An integer array
arr
Output Format:
- The list of qualifying elements in order
Example:
Input: [3, 1, 5, 2, 8, 4]
Output: 3, 5, 8
17. Minimum Count of Binary Digit Numbers Summing to a Target
Problem Statement: Given a target sum, find the minimum number of numbers made up of only 0s and 1s that add up to exactly that target.
Input Format:
- An integer
target
Output Format:
- The minimum count of such numbers required
Example:
Input: target = 33
Output: 3
18. Reverse a String Preserving Spaces and Punctuation
Problem Statement: Given a string containing letters, spaces, and punctuation, reverse only the letters while keeping every space and punctuation mark in its original position.
Input Format:
- A string
s
Output Format:
- The transformed string
Example:
Input: a, b-c!
Output: c, b-a!
19. Generate All Valid IP Addresses
Problem Statement: Given a string of digits, return all possible valid IPv4 addresses that can be formed by inserting dots into the string.
Input Format:
- A string
sof digits
Output Format:
- A list of valid IPv4 addresses
Example:
Input: 25525511135
Output: 255.255.11.135, 255.255.111.35
Guess the Output Practice Topics
Zoho's written test includes fill in the blank output prediction questions rather than multiple choice. Practice predicting exact output for code involving:
- Pointer arithmetic and pointer to pointer behaviour in C.
- String manipulation functions and off by one errors in loops.
- Nested loops and recursion with changing base cases.
- Matrix traversal and 2D array indexing.
- Operator precedence and increment or decrement operator tricks in C and Java.
Mini Project and Advanced Round Tasks Reported
Zoho's advanced coding round is unlike a typical DSA round. Reported tasks include:
- Taxi booking module: Allocate taxis to incoming booking requests and display earnings and booking details for a driver.
- Invoice management system: Design database tables and an ER model, then write SQL queries against your own schema.
- Mini e-commerce store: Build profile, inventory, order, and payment modules, including cart validation against available inventory and basic password encryption.
Treat these as a signal to practice designing small, working systems end to end, not just solving isolated problems.
At Last
Zoho rewards candidates who can design and defend real systems, not just solve isolated coding problems, so practice building small end to end projects alongside your regular DSA revision. The written test rewards careful reading over speed, so slow down and trace through the code snippets rather than guessing.
Join the Telegram group for more resources and discussions.