Upload Button Icon Add office photos

Zoho

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Zoho Software Developer Intern Interview Questions, Process, and Tips

Updated 14 Jul 2024

Top Zoho Software Developer Intern Interview Questions and Answers

  • Q1. Find Duplicates in an Array 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 ...read more
  • Q2. Sum of Two Numbers Represented as Arrays Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two n ...read more
  • Q3. How to merge a list of sorted arrays in sorted order?

Zoho Software Developer Intern Interview Experiences

4 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

1hr mostly was c questions focusing on pointers, arrays and strings. Few logical questions were there too

Round 2 - Coding Test 

2hrs, 5 questions. 1 easy and 4 medium. All leetcode type problems with arrays, strings and matrix

Round 3 - Coding Test 

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.

Round 4 - Technical 

(2 Questions)

  • Q1. How to merge a list of sorted arrays in sorted order?
  • Ans. 

    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.

  • Answered by AI
  • Q2. Simple discussions about oops, project etc
Round 5 - HR 

(3 Questions)

  • Q1. Self introduction for 2 mins
  • Q2. Why do you want to join Zoho?
  • Q3. What kinda word does Zoho do
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Grind leetcode guys. That's the only way.

Skills evaluated in this interview

Software Developer Intern Interview Questions & Answers

user image 21F256 SUNITHA SREE. C. S

posted on 15 Jun 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

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.

Round 2 - Coding 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.

Interview Preparation Tips

Topics to prepare for Zoho Software Developer Intern interview:
  • DSA
  • Low Level design
  • SQL
  • Java
  • CS fundamentals
Interview preparation tips for other job seekers - Be well prepared in coding with efficient time complexity. Java Collections are not allowed in coding round

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I was interviewed before Sep 2020.

Round 1 - Video Call 

(2 Questions)

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 an Array

    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...

  • Q2. 

    Sum of Two Numbers Represented as Arrays

    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 2 - HR 

Round duration - 30 mins
Round difficulty - Easy

This was the final round for me

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in ChennaiEligibility criteriaNo CriteriaZoho Corporation interview preparation:Topics to prepare for the interview - CORE JAVA, DATA STRUCTURES, OOPS, Computer network, DBMS, SQL, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Take mock interviews with friends
Tip 2 : Be strong with implemention 
Tip 3 : Practice aptitue as well

Application resume tips for other job seekers

Tip 1 : Don't make resume too lengthy.
Tip 2 : Only put those skills in your resume on which you are confident

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Mar 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

15 questions in 30 mins

Round 2 - Coding Test 

Questions on string

Interview Preparation Tips

Topics to prepare for Zoho Software Developer Intern interview:
  • Java
Interview preparation tips for other job seekers - The questions will be asked from the basics. So keep your basics strong

Zoho interview questions for designations

 Software Engineer Intern

 (1)

 Software Developer

 (151)

 Developer Intern

 (1)

 Junior Software Developer

 (3)

 Senior Software Developer

 (1)

 Software Engineer Developer

 (1)

 Associate Software Developer

 (1)

 Software Developer Trainee

 (1)

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.

Round 1 - Coding Test 

45 minutes
arrays, strings,
SHL

Round 2 - Technical 

(2 Questions)

  • Q1. Find number of nodes in a tree and it's time complexity
  • Ans. 

    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

  • Answered by AI
  • Q2. What is abstraction and how do you implement it ??
  • Ans. 

    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...

  • Answered by AI
Round 3 - Technical 

(2 Questions)

  • Q1. What is the minimum number of coins to reach the target with the coins 1,2,5
  • Ans. 

    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

  • Answered by AI
  • Q2. Byte stream to human readable format without using library
  • Ans. 

    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

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

OnCampus Test including DSA Questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. Introduce yourself
  • Q2. DSA Question based on Dynamic Programming

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for DSA

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Arithmetic Expression Evaluation Problem Statement

    You are provided with a string expression consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...

  • Ans. Reverse Polish Notation

    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, ...

  • Answered Anonymously
  • Q2. 

    Maximum Product Subarray Problem Statement

    Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.

    Explanation:

    A subarray can be derived from th...

  • Ans. Brute-force

    Steps:

    1. Create an ans variable and initialize it to INT_MIN.
    2. Run a loop i = 0 to N and do:
      • Run a loop j = i to N and do:
        • Create a variable, say currentProduct and initialize it to 1.
        • Run a loop k = i to j and do:
          • currentProduct = currentProduct * arr[k]
          • Store the maximum of ans and the currentProduct in the ans variable.
    3. Finally, return the ans variable.
    Space Complexity: O(1)Explanation:

    O(1)

     

    Constant space is u...

  • Answered Anonymously
  • Q3. 

    Angle Calculation Between Clock Hands

    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.

    Example:

    Inp...
  • Ans. Using reference time
    • The idea is to take the 12:00 i.e. H = 12  and M = 0 as reference time.
    • First,  calculate the angle made by the hour hand with respect to 12:00 in H hours and M minutes. In 12 hours the hour hand moves by 360 degrees i.e. 30 degrees in 1 hour and 0.5 degrees in 1 minute. So in H hours and M minutes, the angle moved by hour hand is  0.5 * (H * 60 + M).
    • Then, calculate the angle made by m...
  • Answered Anonymously
Round 2 - Face to Face 

(2 Questions)

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.

  • Q1. 

    Problem Statement: Sibling Nodes

    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...

  • Ans. DFS Approach

    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...

  • Answered Anonymously
  • Q2. Design an elevator system for a single building with N floors.
  • Ans. 

    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.

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaNo criteriaMicrosoft interview preparation:Topics to prepare for the interview - Data Structures and Algorithms problems with Trees, Graphs, stack etc. Basic System Designing. Database Management System and SQL queries. Operation System and Process Scheduling techniques.Time required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Feb 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. 

    Minimum Time To Solve The Problems

    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...

  • Ans. Brute Force

    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<...

  • Answered Anonymously
  • Q2. 

    Sum of Bit Difference Among All Pairs Problem Statement

    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...

  • Ans. Brute Force
    • Run two nested loops to get every pair that can be formed using the given array elements.
    • For each pair calculate the different bits.
    Space Complexity: O(1)Explanation:

    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...

  • Answered Anonymously
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Sum of LCM Problem Statement

    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) + ....

  • Ans. Brute force approach

     

    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...

  • Answered Anonymously
  • Q2. 

    Sudoku Solver

    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...

  • Ans. BACKTRACKING

    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:

    1. Check, if ARR[i][j] = 0 for each 1<=i<=9 and 1<=j<=9:
      1. Iterate for each 1<= VAL <=9 ...
  • Answered Anonymously
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

  • Q1. 

    Problem Statement: Delete Node In A Linked List

    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...

  • Ans. Brute-force

    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...

  • Answered Anonymously
Round 4 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

Timing was around 3 pm.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    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.

    Example of Sub...

  • Ans. Brute Force

    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...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in DelhiEligibility criterianoGoogle interview preparation:Topics to prepare for the interview - Confidence in Problem-Solving, Data Structures & Algorithms (PS/DS), Practice a few machine coding problems, Refine CS foundations notes, Fix common interview mistakes, Start coding a few problems on whiteboard or paper to get used to it.Time required to prepare for the interview - 8 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice on white board 
Tip 2 : Spend daily some time 
Tip 3 : Practice previous questions

Application resume tips for other job seekers

Tip 1 : Resume should be short and neat
Tip 2 : Keep only thing in which you are sure you will answer all questions

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(1 Question)

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..

  • Q1. 

    Prime Time Again Problem Statement

    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 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. 

    Find the Third Greatest Element

    Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.

    Input:

    The first line contains a single integer 'T' representing the numb...
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. Can you describe your projects and the tech stack you used in them?
Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in HyderabadEligibility criteriaNo criteriaNCR Corporation interview preparation:Topics to prepare for the interview - OOPS, Aptitude, Data Structures, DBMS, Recursion, Dynamic Programming, PuzzlesTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice Data Structures and Algorithms.
Tip 2 : Practice Puzzles from GFG. 
Tip 3 : Should have good knowledge of OOPS.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Telephonic Call 

Round duration - 90 Minutes
Round difficulty - Easy

It was a telephonic round. The interview asked me these questions.
 

Round 2 - Video Call 

(1 Question)

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.
 

  • Q1. 

    Maximum Frequency Number Problem Statement

    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...

  • Ans. Brute Force Approach

    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.

     

    Algorithm:

     

    • Declare 4 variables as ‘maxFrequency’ , ‘currentFrequency’ , ‘maxElement’ , ‘currentElement’ and initialize them with 0
    • Run a loop from ‘i’ = ‘0’ to ‘N’
      • Set ‘currentElement’ as arr[i] and ‘curr...
  • Answered Anonymously
Round 3 - Video Call 

(2 Questions)

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

  • Q1. Design a parking lot system.
  • Q2. 

    Zigzag Binary Tree Traversal Problem Statement

    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...

  • Ans. Iterative Approach

    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:

     

    1. Create an empty queue.
    2. For each node, first, the node is visited and then it’s child nodes are added in the queue if they exist(First in first out).
    3. ...
  • Answered Anonymously
Round 4 - Video Call 

(2 Questions)

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.

  • Q1. 

    Tree Symmetricity Problem Statement

    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...

  • Ans. Inorder And Reverse Inorder

    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...

  • Answered Anonymously
  • Q2. 

    Search In Rotated Sorted Array Problem Statement

    Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.

    Note:
    1. If 'K' is not present...
  • Ans. Naive Approach

    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).


    Java (SE 1.8)
    /*
    
    Time Compl...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in NoidaEligibility criteriaNo criteriaAdobe interview preparation:Topics to prepare for the interview - Data Structures, Computer Networks, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

Tip 1 : Don't put false things on your resume.
Tip 2 : Mention some good projects on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Zoho Interview FAQs

How many rounds are there in Zoho Software Developer Intern interview?
Zoho interview process usually has 3 rounds. The most common rounds in the Zoho interview process are Coding Test, Aptitude Test and Technical.
What are the top questions asked in Zoho Software Developer Intern interview?

Some of the top questions asked at the Zoho Software Developer Intern interview -

  1. How to merge a list of sorted arrays in sorted ord...read more
  2. What kinda word does Zoho...read more

Tell us how to improve this page.

Zoho Software Developer Intern Interview Process

based on 2 interviews

2 Interview rounds

  • Aptitude Test Round
  • Coding Test Round
View more

Zoho Software Developer Intern Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

4.0

Skill development

3.0

Work-life balance

4.0

Salary

1.0

Job security

4.0

Company culture

2.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Member Technical Staff
1.5k salaries
unlock blur

₹5.6 L/yr - ₹23 L/yr

Technical Support Engineer
551 salaries
unlock blur

₹2.2 L/yr - ₹10.8 L/yr

Software Developer
405 salaries
unlock blur

₹4.5 L/yr - ₹16.4 L/yr

Software Engineer
80 salaries
unlock blur

₹3.6 L/yr - ₹14 L/yr

Web Developer
80 salaries
unlock blur

₹3.5 L/yr - ₹12.5 L/yr

Explore more salaries
Compare Zoho with

Freshworks

3.5
Compare

Salesforce

4.0
Compare

SAP

4.2
Compare

TCS

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview