Zoho
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
1hr mostly was c questions focusing on pointers, arrays and strings. Few logical questions were there too
2hrs, 5 questions. 1 easy and 4 medium. All leetcode type problems with arrays, strings and matrix
2hrs, simple application development like creating a backend for shopping application. Only simple functions like adding products, quantity, ordering, if quantity is not there then refuse the order and such. Was not asked for DB implementations.
Merge sorted arrays using a min heap to maintain sorted order.
Create a min heap and insert the first element from each array into the heap.
Pop the smallest element from the heap and add it to the result array.
Replace the popped element in the heap with the next element from the same array.
Continue this process until all elements are merged.
Zoho is a software company that provides cloud-based business applications.
Zoho offers a suite of productivity and collaboration tools such as Zoho CRM, Zoho Books, and Zoho Projects.
Zoho's products are designed to help businesses manage their operations more efficiently.
Zoho's software is cloud-based, allowing users to access their data from anywhere with an internet connection.
posted on 15 Jun 2024
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
Aptitude test had an ample of time(75 min). Consisted of only 20 questions (10 simple aptitude and 10 C output predictions).There were no options given, it was pen and paper test.
The coding round was split into 2.First phase they will give you 2 basic questions(mostly one pattern question) you should be able to complete it within 30 min. If not you should walk away.in the second phase 3 medium level DSA questions will be given you should solve it with 45 min(not sure).You should code them without using any inbuilt library functions.
I was interviewed before Sep 2020.
Round duration - 240 mins
Round difficulty - Easy
C++/Java on any code editor with screen share and video call for rounds 3 and 4.
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Round duration - 30 mins
Round difficulty - Easy
This was the final round for me
Tip 1 : Take mock interviews with friends
Tip 2 : Be strong with implemention
Tip 3 : Practice aptitue as well
Tip 1 : Don't make resume too lengthy.
Tip 2 : Only put those skills in your resume on which you are confident
What people are saying about Zoho
I applied via Campus Placement and was interviewed before Mar 2021. There were 2 interview rounds.
15 questions in 30 mins
Questions on string
Zoho interview questions for designations
I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.
45 minutes
arrays, strings,
SHL
To find number of nodes in a tree, perform a depth-first or breadth-first traversal and count the nodes. Time complexity is O(n).
Perform a depth-first or breadth-first traversal of the tree
Count the nodes as you traverse the tree
Time complexity is O(n) where n is the number of nodes in the tree
Abstraction is the concept of hiding complex implementation details and showing only the necessary information.
Abstraction allows developers to focus on the essential features of an object or system.
It helps in reducing complexity and improving efficiency in software development.
Implement abstraction in programming by using abstract classes and interfaces.
Example: In a car, we don't need to know the internal workings o...
The minimum number of coins to reach a target amount can be calculated using dynamic programming.
Use dynamic programming to calculate the minimum number of coins needed to reach the target amount.
Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount.
Iterate through the coin denominations and update the minimum number of coins needed for each amount based
Convert byte stream to human readable format without using library
Iterate through the byte stream and convert each byte to its ASCII character representation
Concatenate the ASCII characters to form the human readable format
Handle special characters and edge cases appropriately
OnCampus Test including DSA Questions
posted on 15 Sep 2021
I was interviewed in Apr 2021.
Round duration - 90 minutes
Round difficulty - Easy
There were 3 coding questions. All of them were pretty easy and solvable in less than 30 minutes. Some string and pattern matching + some number theory problems were there.
You are provided with a string expression
consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...
Infix Expressions are harder for Computers to evaluate because of the additional work needed to decide precedence, so we first convert infix expressions into either postfix or prefix expressions. In this approach, we convert Infix expression into Postfix expression also known as Reverse Polish Notation, and then evaluate the postfix expression using stack. Note in postfix expression, ...
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
A subarray can be derived from th...
Steps:
O(1)
Constant space is u...
Given a specific time in hours and minutes, your task is to calculate the smallest possible angle between the hour hand and the minute hand of a clock.
Round duration - 45 minutes
Round difficulty - Medium
This was a technical round. First after properly introducing ourselves(me and the interviewer), we started with the main interview. I was asked 2 questions, one DS and Algorithms and the other System Design question.
You are provided with a Binary Tree consisting of 'N' nodes, where each node holds an integer value. Your objective is to identify and list all nodes that do not possess a...
The idea here is to use the fact that if a node of the binary tree has two child nodes, then both of them will be siblings to each other, and if a node of the binary tree has only one child, then that child will not have any sibling.
Example
In above figure 1 has two children, so nodes 3 and 4 are siblings to each other. Also, 3 has only one child, i.e., 5 and 5 have no sibling node.
So, we will use a df...
Tip 1 : Discuss first about how the product(here, elevator) will function.
Tip 2 : Start making with the most basic classes for the elevator.
Tip 3 : One by one after making the basic class, add new functionalities to it, taking care of all corner cases.
Tip 1 : Make sure to solve the most recommended problems of LeetCode. Around 200 will do
Tip 2 : Be confident with your basics of chapters from Operating Systems and DBMS or SQL Queries.
Tip 3 : Have a slight knowledge of system designing concepts.
Tip 1 : Make your Resume such that it is properly readable. Keep it of one page. If it exceeds try your best to include only the most important highlights.
Tip 2 : Put your most important achievements at the top and after than the not so important ones. You want the interviewer to see them first.
I was interviewed in Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
We want to assign N number of subjects among K friends. So consider this as dividing the array into K partitions, where each partition denotes the subjects assigned to one of the friends. Assume that we already have K-1 partitions i.e. we have already assigned the subjects to K-1 friends, and now we want to do the K th partition. So, this last divider can be put between i th and i+1 th subject for 1<=i<...
Given an array of integers, determine the sum of bit differences among all possible pairs that can be formed using the elements of the array.
The b...
O(1)
No extra space is required.
Time Complexity: O(n^2)Explanation:O(N^2), where ‘N’ is the number of elements in the given integer array.
We have to run two nested loops to get every pair that can be formed using the given array ele...
Round duration - 60 minutes
Round difficulty - Medium
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:LCM(1, N) + LCM(2, N) + ....
Using the mathematical formula, A*B = LCM(A,B) * GCD(A,B) where ‘A’ and ‘B’ are the two integers, and GCD(A,B) denotes the Greatest common divisor of ‘A’ and ‘B’.
For example, suppose
A = 20 and B = 30
Factors of A = {1,2,4,5,10,20}
Factors of B = {1,2,3,5,6,10,15,30}
The greatest common factor is 10, hence GCD(20,30) = 10.
So LCM(A,B) = A*B / GCD(A,B)
All we need to fin...
Given a 9x9 Sudoku board, your task is to fill the empty slots and return the completed Sudoku solution.
A Sudoku is a grid composed of nine 3x3 smaller grids. The challenge is to fill in the...
Our approach here will be to check for each empty slot that filling it with which number will not violate any constraint. We will start from the first block and keep on checking for each block using recursion. Consider a function SOLVESUDOKU for this, that accepts as a parameter an ArrayList ARR and do:
Round duration - 60 minutes
Round difficulty - Hard
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Approach:
We need to delete the node K from the linked list. The most general way to delete the node K from a singly linked list is to get access to the previous node of K. We can get access to the previous node by traversing from the head of the linked list. Let’s denote this previous node as P. Then, we update the next pointer of P to the next pointer of K.
Although the reference to node K is giv...
Round duration - 60 Minutes
Round difficulty - Easy
Timing was around 3 pm.
Given an array ARR
consisting of N
integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
We will iterate through all possible boundaries of the subarrays in the given array with the help of two nested loops.
Then, we will iterate through each subarray with the help of another loop and find the sum of the subarray. We will maintain the maximum subarray sum through our iterations and finally return it.
Space Complexity: O(1)Explanation:O(1), constant space is used.
Time Complexity: O(n^3...Tip 1 : Practice on white board
Tip 2 : Spend daily some time
Tip 3 : Practice previous questions
Tip 1 : Resume should be short and neat
Tip 2 : Keep only thing in which you are sure you will answer all questions
I was interviewed in Jan 2021.
Round duration - 150 minutes
Round difficulty - Medium
It was an online round consisting of 2 programming questions restricted to C++, Java, and C# and 10 MCQ's on Data structures, Algorithms, etc..
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total ins...
Round duration - 60 minutes
Round difficulty - Easy
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
Tip 1 : Practice Data Structures and Algorithms.
Tip 2 : Practice Puzzles from GFG.
Tip 3 : Should have good knowledge of OOPS.
Tip 1 : Have some good projects on your resume.
Tip 2 : Do not anything false in your resume.
Tip 3 : Mention your coding profiles in your resume.
I was interviewed in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Easy
It was a telephonic round. The interview asked me these questions.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Here, we can simply run two loops. The outer loop picks all elements one by one and the inner loop finds the frequency of the picked element and compares it with the maximum present so far.
Round duration - 60 Minutes
Round difficulty - Medium
This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...
Our very basic intuition is that we are going to traverse the given binary tree using level order traversal where we just need to modify one thing that for every alternate level we need to reverse the order that level.
Steps are as follows:
Round duration - 90 minutes
Round difficulty - Medium
1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.
You are provided with a binary tree structure, where each node consists of an integer value. Your task is to determine whether this binary tree is symmetric.
A symmetr...
We do two inorder traversals recursively of the tree simultaneously. For the first traversal, we traverse the left child first and then the right child, and in the second traversal, we traverse the right child first and then the left child. Let cur1 and cur2 be the current nodes of the first and second traversals respectively and initially both of them are passed as root. Then the algorithm f...
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Naively traverse the array and find if ‘K’ is present in ARR or not. If ‘K’ is present in ARR return its index else return -1.
Space Complexity: O(1)Explanation:O(1), i.e. constant space complexity.
Time Complexity: O(n)Explanation:O(N), where N is the length of the array/list.
We are iterating over the array/list ARR once. Hence, the time complexity is O(N).
/*
Time Compl...
Tip 1 : Don't lie on your resume.
Tip 2 : Practice at least 400 different types of coding problems.
Tip 3 : Work on your communication skills.
Tip 1 : Don't put false things on your resume.
Tip 2 : Mention some good projects on your resume.
based on 2 interviews
2 Interview rounds
based on 1 review
Rating in categories
Member Technical Staff
1.5k
salaries
| ₹5.6 L/yr - ₹23 L/yr |
Technical Support Engineer
551
salaries
| ₹2.2 L/yr - ₹10.8 L/yr |
Software Developer
405
salaries
| ₹4.5 L/yr - ₹16.4 L/yr |
Software Engineer
80
salaries
| ₹3.6 L/yr - ₹14 L/yr |
Web Developer
80
salaries
| ₹3.5 L/yr - ₹12.5 L/yr |
Freshworks
Salesforce
SAP
TCS