Zoho: Software Developer
Zoho's fresher hiring is known to be coding-heavy, with guides describing an aptitude or written test (some say none), a basic programming round, an advanced programming round that often asks for a small working application, then technical and HR interviews. Zoho does not publish its process, so everything here is candidate-reported; check the Zoho careers page for your track.
29 questions · 4 rounds · updated Nov 2026
How the interview works
- Written test: Optional per source: C output and logic puzzles.
- Basic programming round: Strings, patterns, numbers and arrays without library helpers.
- Advanced programming round: Matrix, string and design-style problems; sometimes a small application.
- Technical interview: Project depth, data structures, OOP and DBMS.
- HR interview: Commitment, relocation and fit.
Sample questions
- 01
Design the classes for a parking lot system (low-level design).
MediumLow-level design
Model answer
What the interviewer checks
Clean object modelling, SOLID, extensibility and handling concurrency for spot allocation.
How to answer
Requirements: several floors; spot types (bike, compact, large, EV); vehicles park in a fitting spot; tickets at entry; payment at exit by duration and type; display free spots. Classes: • ParkingLot (singleton or injected): floors, entry and exit gates, `findSpot(vehicle)`. • Floor: a list of ParkingSpot, plus free counts per type. • ParkingSpot: id, type, isFree, `assign(vehicle)`, `release()`. • Vehicle (abstract) → Bike, Car, Truck, each with a required SpotType. • Ticket: id, vehicle, spot, entryTime. • SpotAllocationStrategy (interface) → NearestFirst, EVPriority: the strategy pattern, so the rule can change without editing ParkingLot. • PricingStrategy (interface) → HourlyPricing, WeekendPricing. • Payment → Cash, UPI, Card. Flow: the entry gate calls `lot.findSpot(vehicle)` → `spot.assign()` → issues a Ticket. The exit gate calculates the fee with PricingStrategy → takes payment → `spot.release()`. Concurrency: two gates may grab the same spot, so make assign atomic (synchronized, or a compare-and-set on isFree), or hand out spots from a per-type thread-safe queue. Extensions to mention: reservations, a display board updated through an observer, and monthly passes.
- 02
Check whether a number is an Armstrong number (equal to the sum of its digits each raised to the number of digits). Example: 153 → true (1³ + 5³ + 3³), 9474 → true
EasyMath
Approach and solution
Approach
Count the digits, then add each digit to that power. Work with integer division and modulo if the test bans string conversion.
def is_armstrong(n: int) -> bool: k = len(str(n)) total, m = 0, n while m: total += (m % 10) ** k m //= 10 return total == n assert is_armstrong(153) and is_armstrong(9474) assert not is_armstrong(123)Complexity: O(d) for d digits.
- 03
Print all prime numbers up to N (N up to 10^6). Example: N = 20 → 2 3 5 7 11 13 17 19
EasyMath
Approach and solution
Approach
The Sieve of Eratosthenes: mark multiples of each prime starting from its square. Checking each number by trial division is O(n√n) and times out for large N in online tests.
def primes_upto(n: int): if n < 2: return [] is_p = [True] * (n + 1) is_p[0] = is_p[1] = False i = 2 while i * i <= n: if is_p[i]: for j in range(i * i, n + 1, i): is_p[j] = False i += 1 return [i for i in range(n + 1) if is_p[i]] assert primes_upto(20) == [2, 3, 5, 7, 11, 13, 17, 19]Complexity: O(n log log n) time, O(n) space.
26 more questions, members only
- Programming round 16
- Advanced programming round8
- Technical interview9
- HR interview6
Members also get how to answer each question and a preparation plan for this company.
See plans from ₹399Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.