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 appeared for an interview 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...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a HashSet to store seen elements.
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...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
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
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
Top trending discussions
posted on 26 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 4 interview rounds.
Data scraping, computer vision, agile methodologies, change request, and testing methods are all important aspects of software engineering.
Data scraping involves extracting data from websites or other sources.
Computer vision involves using algorithms to interpret and analyze visual data.
Agile methodologies are a set of principles for software development that prioritize flexibility and collaboration.
Change requests are...
posted on 30 Nov 2021
I applied via Recruitment Consultant and was interviewed before Nov 2020. There were 3 interview rounds.
Find sum of squares of numbers in list using stream API.
Use mapToInt() to convert list of integers to IntStream
Use map() to square each element of IntStream
Use sum() to get the sum of squares
Searching in 2D sorted array row wise and column wise.
Start from the top right corner or bottom left corner
Compare the target with the current element
Move left or down if target is smaller or move right or up if target is larger
Repeat until target is found or out of bounds
posted on 8 Apr 2021
posted on 15 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
It was a video call round, that began with a brief introduction of the interviewer followed by mine. Then the interviewer asked me to solve 2 data structure questions in a text editor while sharing my screen. Also, we had a brief discussion of the time complexity of the programs I had written, which I had to optimize to the best time complexity as well.
You are given a N x M
matrix of integers. Your task is to return the spiral path of the matrix elements.
The first line contains an integer 'T' which denotes the nu...
The task is to return the spiral path of elements in a given matrix.
Iterate through the matrix in a spiral path by keeping track of boundaries.
Print elements in the order of top, right, bottom, and left sides of the matrix.
Handle cases where the matrix is not a square (N != M) separately.
Consider edge cases like single row, single column, and empty matrix.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
This approach sorts the array in a single scan without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
It was a face-to-face round in the Hyderabad Office at 8 in the morning. This round consisted of various types of questions. It began with a brief description of my interest in technology and a discussion about any major problems I faced working and how I resolved it. Then it continued with various data structure questions, followed by operating system, database, and system design questions. I had majorly worked with the project Jarvis Personal Assistant, so I was asked to design the complete workflow of the project.
Given a string S
containing only uppercase English characters, determine if S
is identical to its reflection in the mirror.
S = "AMAMA"
YES
Determine if a given string is identical to its reflection in the mirror.
Iterate through the string and compare characters from start and end simultaneously.
If characters are not equal, return 'NO'.
If all characters match, return 'YES'.
Tip 1 : I would recommend to practice at least 2-3 competitive coding questions daily, to always have hands-on Competitive coding and be prepared for it. Also, you can create a group among your friends and solve together, this will help to maintain the enthusiasm and competitive nature to grow daily in long run.
Tip 2 : I will surely advise to develop and work on some good projects, that really help in understanding the development basics as well as help in maintaining a good resume. Having a good open-source contribution also helps in providing an edge over other students.
Tip 3 : Spare some time in taking up some mock-interviews in websites such as InterviewBit, this helps to rectify the mistakes and build a good experience of the interview. Also, try to interview with as many companies as possible, this will strengthen interview and presentation skills.
Tip 1 : Don't try to fake anything in the resume as this might lead to a very bad impression in the later rounds, also may lead to disqualification from further openings in the company.
Tip 2 : In this era, try developing and showcasing more projects in the resume instead of online course certificates. Recruiters are looking for actual skill and knowledge which is actually depicted from the projects and this will also lead to keeping a higher stand from other students.
I appeared for an interview before Sep 2020.
Given an integer array ARR
of size N
and an integer K
, determine the minimum number of elements that need to be removed so that the difference between the maximum and mi...
Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...
Given an array/list ARR
of integers with length 'N', identify all elements that appear more than floor(N/3)
times within the array/list.
T (number of test ...
Given an array arr
of N
non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
The first line of inp...
The round was held in the evening, it was a telephonic interview on Google meet. The interviewer was very friendly and told me to relax and focussed.
Telephonic round on Google meet.
In the evening
Tip 1 : Build a strong resume reflecting your coding skills for the resume shortlisting round. (Mention some achievements to highlight your resume)
Tip 2 : Good knowledge of data structures and algorithms
Tip 3 : Proficient in at least one coding language.
Tip 1 : Build a strong resume reflecting your coding skills including some simple projects in any tech bucket.
Tip 2 : Mention some achievements to highlight your resume and different from other candidates.
posted on 19 May 2022
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal of the binary tree.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes represented by '-1' appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
Round duration - 60 Minutes
Round difficulty - Easy
You are given a list of N
strings called A
. Your task is to determine whether you can form a given target string by combining one or more strings from A
.
The strings from A
c...
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to form the target string.
Use recursion to try different combinations of strings.
Check if the current combination forms the target string.
Return true if a valid combination is found, otherwise return false.
Round duration - 60 Minutes
Round difficulty - Easy
Design an elevator system for efficient vertical transportation.
Divide building into zones to optimize elevator usage.
Implement algorithms for efficient elevator scheduling.
Include safety features like emergency stop buttons and overload sensors.
Consider user interface for passengers to select floors and monitor elevator status.
Tip 1 : Never give up
Tip 2 : Practice
Tip 3 : Be positive
Tip 1 : Keep it short
Tip 2 : Highlight skills and achievements
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
572
salaries
| ₹3.3 L/yr - ₹10.5 L/yr |
Software Developer
459
salaries
| ₹4.5 L/yr - ₹20 L/yr |
Software Engineer
128
salaries
| ₹4.6 L/yr - ₹16.2 L/yr |
Web Developer
82
salaries
| ₹3.5 L/yr - ₹12 L/yr |
Freshworks
Salesforce
SAP
TCS