Interview experience
Zoho Interview Questions and Answers (2026)
Overview
Section titled “Overview”Zoho’s fresher hiring is unusually C-heavy and application-building focused, and famously does not filter by CGPA or branch - candidates are judged almost entirely on written-test and coding-round performance.
Zoho interview process at a glance
Section titled “Zoho interview process at a glance”| Round | Duration | What they test |
|---|---|---|
| Resume Screening | 2-5 days | Application only - no CGPA cutoff |
| Aptitude & C Programming Test | 90-120 min | Pen-and-paper aptitude + C output prediction (pointers, arrays, recursion) |
| Basic Programming Round | 2-3 hours | 5 coding problems - pattern printing, array/string manipulation |
| Advanced Programming/Application Round | 90-120 min | Build a complete mini-application with file handling |
| Technical Interview | 30-45 min | Code review of your own submissions, C/data-structures follow-ups |
| HR Interview | 20-30 min | Background, relocation, learning mindset |
Aptitude & C Programming Test
Section titled “Aptitude & C Programming Test”A pen-and-paper written test combining general aptitude with C output-prediction questions. The C section is the real filter - it goes deep on pointer arithmetic, memory, and recursion rather than surface-level syntax.
Common questions
- Predict the output of C snippets involving pointer arithmetic and array indexing
- Trace recursive function output step by step
- Standard aptitude/logical-reasoning questions
Basic Programming Round
Section titled “Basic Programming Round”A longer, 2-3 hour coding round with 5 problems, typically weighted toward pattern-printing and array/string manipulation. Code clarity and correct logic matter more than raw problem count solved.
Common questions
- Pattern-printing problems (numeric/star patterns)
- Array manipulation and searching/sorting variants
- String processing and basic logic-building problems
Advanced Programming/Application Round
Section titled “Advanced Programming/Application Round”Instead of isolated problems, you build a small but complete application with file-based persistence - candidates report library-management systems, quiz apps, and address-book applications as common briefs.
Common questions
- Build a library management system (add/remove books, issue/return, file storage)
- Build a quiz application with score calculation and file-based question storage
- Structure your code modularly and implement correct file I/O
Full round-by-round narratives are on the Zoho interview experience page.
Technical Interview
Section titled “Technical Interview”The most distinctive round: rather than fresh problems, the interviewer reviews the code you wrote in the Basic Programming and Application rounds and asks you to explain, optimize, and defend it.
Common questions
- Explain and optimize a piece of code you wrote in an earlier round
- How would you implement a linked list, stack, or queue in C?
- Pointer and memory-management follow-ups tied to your own submitted code
- How would you handle an edge case your original solution missed?
HR Interview
Section titled “HR Interview”A conversational closing round on background, relocation, and long-term intent - candidate reports describe it as friendly rather than adversarial.
Common questions
- Tell me about your background and what drew you to programming
- Are you willing to relocate (many drives are Chennai-based)?
- Why Zoho, and what are your long-term career goals?
- What do you know about Zoho’s culture and values?
Sample answer frameworks for each of these are on the Zoho HR interview questions page.
Why Zoho’s hiring bar looks different
Section titled “Why Zoho’s hiring bar looks different”Zoho is unusual among large product companies for explicitly not filtering by CGPA or degree branch - hiring decisions rest almost entirely on written-test and coding-round performance. This is a deliberate policy, not an oversight: candidates from mechanical, ECE, and other non-CS backgrounds with strong self-taught C skills regularly clear the process alongside CS candidates. If you’re weighing whether a lower CGPA rules Zoho out, it doesn’t - but the C-fundamentals bar in the written test and the code-review-style technical interview are correspondingly harder to bluff through than a typical resume-filtered process.
Common technical interview questions and answers
Section titled “Common technical interview questions and answers”Q: In C, what is the difference between an array name and a pointer?
An array name is not a pointer variable - it is the array itself, and in most expressions it decays to a pointer to its first element. The differences show up where decay does not happen: sizeof(arr) on an array of 10 ints gives 40 bytes, while sizeof(ptr) gives the pointer width (usually 8), and &arr has type pointer-to-array rather than pointer-to-pointer. You also cannot assign to an array name, so arr = something is a compile error, whereas a pointer can be reassigned freely. This is exactly why sizeof stops working inside a function that takes the array as a parameter: the parameter is genuinely a pointer, so you must pass the length separately.
Q: What is pointer arithmetic, and what does p + 1 actually add?
Pointer arithmetic is scaled by the size of the pointed-to type, so p + 1 advances by sizeof(*p) bytes, not one byte. For an int pointer on a typical machine that is 4 bytes; for a char pointer it is 1; for a pointer to a 12-byte struct it is 12. That is why arr[i] is defined as exactly *(arr + i), and why the surprising i[arr] also compiles. Subtracting two pointers into the same array yields the number of elements between them, again divided by the element size. Arithmetic that moves outside the array, or on a void pointer, is undefined behaviour in standard C.
Q: What is the difference between malloc and calloc, and what does free actually do?
malloc(n) allocates n bytes and leaves the contents uninitialised, so reading them before writing is undefined behaviour. calloc(count, size) allocates count times size bytes, zero-fills them, and also checks the multiplication for overflow, which makes it the safer choice for arrays. Both return NULL on failure, and that return value must be checked before use. free returns the block to the allocator but does not change your pointer, so the variable still holds the old address - dereferencing it afterwards is a use-after-free and freeing it twice corrupts the heap, which is why the convention is to set the pointer to NULL right after freeing. realloc resizes a block and may move it, so you must assign its return value rather than assuming the old pointer is still valid.
Q: What happens if you write to a string literal through a char pointer?
Given char *s = "hello";, the assignment s[0] = 'H'; is undefined behaviour and on most modern systems it crashes with a segmentation fault. A string literal lives in a read-only data segment, and the pointer points into it, so writing through it attempts to modify read-only memory. The correct way to get a modifiable copy is char s[] = "hello";, which allocates a 6-byte array on the stack (five characters plus the terminating null byte) and copies the literal into it - writing to s[0] is then perfectly legal. This distinction between char *s and char s[] is one of Zoho’s most reliable output-prediction traps, and declaring literals as const char * makes the compiler catch it.
Q: Why does a swap function in C need pointers?
C passes every argument by value, so a function receiving two ints gets copies; swapping the copies leaves the caller’s variables untouched. Passing addresses instead - void swap(int *a, int *b) with a temporary and the dereferences *a and *b - lets the function write through to the caller’s storage. That is why scanf takes &x for an int: it needs the address to store into. The same reasoning explains why a function that must allocate memory for the caller takes a pointer-to-pointer, or returns the new pointer, rather than assigning to a plain pointer parameter.
Q: How do you implement singly linked list insertion and deletion in C?
Define struct Node { int data; struct Node *next; };. To insert at the head, malloc a node, set its data, point its next at the current head, and reassign head to the new node - that is O(1). To insert at the end you walk to the last node, which is O(n) unless you keep a tail pointer. To delete a node you need the previous node so you can set prev->next to the node’s next, then free the removed node; deleting the head is the special case where you move the head pointer first. Losing the next pointer before freeing, or forgetting to free at all, are the two bugs Zoho interviewers check for.
Q: What does a struct’s memory layout look like, and what is padding?
The compiler aligns each member to its natural boundary, so a struct containing a char, then an int, then a char typically occupies 12 bytes rather than 6: three padding bytes after the first char to align the int, and three trailing bytes so the struct’s own size is a multiple of its strictest alignment. Reordering the members largest-first - int, then the two chars - shrinks it to 8. This is why sizeof a struct is often larger than the sum of its members, a favourite Zoho written-test question. It also means you must never compare two structs with memcmp, since the padding bytes hold indeterminate values.
Q: How do you do file handling in C for the application round?
Open with fopen(path, mode) and always check for a NULL return, since a missing file or a permissions problem is the common failure. Use “r”, “w”, or “a” for text, adding “b” for binary and “+” for read-write; note that “w” truncates an existing file immediately, which has cost many candidates their saved data mid-round. For record-style persistence, fwrite and fread on a struct array are the simplest approach, with fseek and ftell for random access, while fprintf and fgets suit human-readable text formats. Always fclose when done, because buffered writes are only guaranteed to reach disk on close or an explicit fflush - a crash before that loses the data.
Frequently asked questions about Zoho interviews
Section titled “Frequently asked questions about Zoho interviews”What is Zoho placement interview experience like?
Zoho’s fresher hiring runs 5-6 stages: 1. Resume screening (2-5 days) - CGPA is explicitly not a filter. 2. Aptitude & C Programming Test (90-120 min) - pen-and-paper format. 3. Basic Programming Round (2-3 hours) - 5 coding problems, mostly pattern-printing and array/string manipulation. 4. Advanced Programming/Application Round (90-120 min) - build a complete mini-application (e.g. library management, quiz app) with file handling. 5. Technical Interview (30-45 min) - a code review of what you wrote in earlier rounds, plus C/data-structures questions. 6. HR Interview (20-30 min) - background, relocation, learning mindset. Total duration: 2-3 weeks from application to offer.
What questions are asked in Zoho interviews?
The written test leans hard on C output-prediction (pointers, arrays, loops, recursion) - tests deep understanding of pointer arithmetic and memory, not just syntax. The programming rounds are pattern-printing, array/string manipulation, and logic-building problems, followed by building a complete small application (address book, quiz app, library system) with file-based persistence. The technical interview is largely a live code review of your own submissions from earlier rounds - expect to explain and optimize code you already wrote, and answer pointer/memory/data-structure questions on the spot.
How many rounds are there in the Zoho interview?
Typically 5-6 stages for freshers: resume screening, an aptitude + C programming written test, a basic programming round (5 coding problems), an advanced/application-building round, a technical interview, and an HR interview. Off-campus drives sometimes compress or reorder a couple of these, but the C-heavy, application-building shape stays consistent.
Does Zoho have a CGPA cutoff?
No - this is one of Zoho’s most distinctive hiring quirks. Zoho evaluates candidates purely on the written test and coding-round performance rather than filtering by CGPA or even branch (candidates from mechanical, ECE, and other non-CS branches with strong self-taught C skills have cleared the process). If your C fundamentals and problem-solving are strong, a lower CGPA does not disqualify you here the way it might elsewhere.
What is the Zoho technical interview like?
The technical interview (30-45 min) is largely a code review of what you wrote in the Basic Programming and Application rounds - the interviewer asks you to explain your approach, optimize sections, and handle edge cases in your own code, rather than posing brand-new problems. Expect follow-up questions on pointers, memory management, and how you’d implement core data structures (arrays, linked lists, stacks, queues) in C. Interviewers reportedly respond well to a genuine learning mindset even when the code isn’t perfect.
How should I prepare for Zoho interviews?
Practice C output-prediction questions specifically - Zoho’s written test tests pointer and memory understanding harder than most companies’ aptitude rounds. Practice writing code on paper, not just in an IDE, since the early rounds are pen-and-paper. Build 1-2 complete small C applications with file handling (a to-do list, address book, or quiz app) before the interview, since the Application round expects a working, modular program, not just isolated functions. Review and be ready to defend your own code from earlier rounds - the technical interview reuses it directly.