Zoho Interview Questions, Process, and Tips for Freshers

Basic questions from speed and distance etc.. verbal and writing

Different topics based on current affairs

Q1. What is your family background?
Add your answer
Q2. Tell me about yourself.
Add your answer
Q3. Are you comfortable in relocation, Basic networking questions like DHCP, DNS . How are wifi modem work and what are the port in it
Add your answer

Aptitude test was of medium level with some pseudo-code o/p questions

Sort array based on frequency,etc

Round duration - 240 mins
Round difficulty - Easy

C++/Java on any code editor with screen share and video call for rounds 3 and 4.

Q1. Find duplicates in array
You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. You...read more
Ans. Sorting
1. The most trivial approach would be to sort the array/list ‘ARR’ and then return the duplicates.
2. After sorting the array in non-decreasing order, do the following for all the elements from i = 0 to i = n - 2:
   • If ARR[i] == ARR[i + 1], then add ARR[i] to the the output list.
   • While ARR[i] == ARR[i + 1], do i = i + 1, since we don’t want to add the same duplicate elements again and again.
   • Else continue.
3. After this loop, w...read more
Answered Anonymously
Add your answer
Q2. Sum of Two Arrays
You are given two numbers 'A' and 'B' in the form of two arrays (A[] and B[]) of lengths 'N' and 'M' respectively, where each array element represents a di...read more
Ans.  Two Pointers
1. Approach 1 would fail if the size of arrays is greater than 18 (as the maximum integer range in most of the programming languages is approximately up to 10^18.), so we need a better way to find the sum.
2. We will find the sum in the way we generally do it using a pen and paper i.e starting from the right(LSB), adding individual digits and the previous carry.
3. We can use two pointers to find the sum for each ind...read more
Answered Anonymously
Add your answer

Round duration - 30 mins
Round difficulty - Easy

This was the final round for me

Simple questions, yet tests your analytical skills and logical thinking.

Most of the question related to array. Main focus on reducing time and space complexity of programs. C, c++, java are allowed.