Zoho Campus Interview Experience (On-Campus) | July 27–28, 2026
Anonymous User
379

I recently attended the Zoho on-campus interview and wanted to share my experience. The interview pattern varied across batches, so don't assume everyone gets the same set of questions or the same flow.

Round 1 – Aptitude + C Pseudocode (2 Hours)

The first round consisted of:

  • 10 Quantitative Aptitude (QA) questions
  • 10 C Pseudocode questions

The duration was 2 hours.


Round 2 – Programming Round (3 Hours)

For my batch, there was a screening problem.

You had to solve the first question before the remaining questions were unlocked. If you couldn't solve it, you were asked to leave without attempting the rest.

Mandatory Screening Question

Sort odd and even elements in an array without using extra space.

  • Sort odd numbers in ascending order.
  • Sort even numbers in descending order.

Example:

Input:
9 4 3 8 7 2 5

Output:
3 8 5 4 7 2 9

(The relative positions remain the same; only odd numbers are sorted among themselves in ascending order, and even numbers among themselves in descending order,you should not change the position of the odd and even elements.)

Remaining Programming Questions

  1. Maximum Circular Subarray

    • Classic Kadane's Algorithm variation.
    • Closest LeetCode: 918. Maximum Sum Circular Subarray
  2. Regex String Matching

    • Pattern matching involving operators like + and *.
    • Closest LeetCode: 10. Regular Expression Matching
  3. String Rearrangement

Input:
cccabbbbcca

Output:
cabcabcbcbc

Characters must be rearranged while preserving the order of their first occurrence.

Closest LeetCode:

  • 767. Reorganize String (similar idea but not exactly the same)
  1. Compare Version Numbers

Given two version strings, compare them and return the result.

Closest LeetCode:

  • 165. Compare Version Numbers
  1. Peak Valley Array

Rearrange the array so that

a0 > a1 < a2 > a3 < a4 ...

There was also an additional constraint involving the adjacent difference:

|ai - ai+1| >= k

(where k was given in the problem).

Closest LeetCode:

  • 324. Wiggle Sort II

Note

My friends were in a different batch, and their experience was different.

  • They received two programming questions initially.
  • After solving those, they were given the remaining three questions.

So the programming round pattern may differ from batch to batch.


Round 3 (L3) (3 Hours)

The L3 round was conducted the next day.

For me, the interviewer asked me to design an Employee Database.

The process was:

  1. Draw the Class Diagram (UML).
  2. Explain the relationships.
  3. Implement the design in code.
  4. Complete 7 implementation tasks based on the design.

I managed to complete 3 out of the 7 tasks.

The interviewer asked me to explain my implementation. Although I explained my approach, they were not satisfied with the overall implementation, and I was rejected in this round.

Interestingly, some of my friends had a different L3 experience:

  • They were asked to draw an ER Diagram instead of a UML Class Diagram.
  • Their interview focused more on database design concepts and related questions than on coding.

Preparation Tips

  • Practice array and string problems.
  • Be comfortable with Algorithms.
  • Revise custom sorting techniques.
  • Learn UML Class Diagrams and ER Diagrams.
  • Practice implementing object-oriented designs in Java/C++.
  • Be ready to explain your logic clearly, not just write working code.

Overall, the interview was challenging but fair. The pattern can vary between batches, so focus on strengthening your problem-solving and design fundamentals rather than memorizing specific questions.

Good luck to everyone preparing for Zoho!

Comments (1)