Zoho
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Job Portal and was interviewed before Apr 2023. There were 3 interview rounds.
Puzzle based questions and Math problems
Given a laptop and problem statement. Had to solve problems at eclipse.
Top trending discussions
posted on 12 Nov 2024
I applied via Approached by Company and was interviewed in May 2024. There was 1 interview round.
To make an array of strings unique, count the number of duplicate elements and increment them accordingly.
Iterate through the array and keep track of the frequency of each element.
For each duplicate element, increment it to make the array unique.
Return the total number of increment operations needed.
Sum all numbers formed from root to leaf paths in a binary tree
Traverse the tree from root to leaf nodes, keeping track of the current number formed
Add the current number to the sum when reaching a leaf node
Recursively explore left and right subtrees
It consisted of both technical programming and theoretical concepts. C++ and SQL
Sorting algorithms differ in their approach to sorting elements in an array.
Bubble Sort - compares adjacent elements and swaps them if they are in the wrong order
Merge Sort - divides the array into two halves, sorts them, and then merges them
Quick Sort - picks a pivot element and partitions the array around the pivot
Selection Sort - repeatedly selects the minimum element and swaps it with the current element
Insertion S...
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
Online coding test with 2 coding questions
Files in RAM are stored temporarily for quick access by the CPU.
RAM (Random Access Memory) is volatile memory used for temporary storage of data and instructions.
Files stored in RAM are accessed much faster than files stored on a hard drive.
RAM is cleared when the computer is turned off, so files stored in RAM are not persistent.
Examples of files stored in RAM include open applications, running processes, and cached da
DSA,COMPUTER FUNDAMENTALS
Tree traversals are methods used to visit each node in a tree data structure in a specific order.
Inorder traversal: Visit left subtree, then root, then right subtree
Preorder traversal: Visit root, then left subtree, then right subtree
Postorder traversal: Visit left subtree, then right subtree, then root
posted on 19 Sep 2022
Go through the basics of all the topics the electronics part of the exam will be tough
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Abcdef jssu ksye ksyd kahe jeheb
Graph dp and tree related mid-hard
Find the longest increasing subsequence in an array.
Use dynamic programming to keep track of the longest increasing subsequence ending at each index.
Iterate through the array and update the longest increasing subsequence for each index.
Return the maximum length of the longest increasing subsequence found.
Member Technical Staff
1.4k
salaries
| ₹5.5 L/yr - ₹23 L/yr |
Technical Support Engineer
539
salaries
| ₹2.7 L/yr - ₹12 L/yr |
Software Developer
360
salaries
| ₹4 L/yr - ₹16.3 L/yr |
Web Developer
81
salaries
| ₹3.5 L/yr - ₹12 L/yr |
Software Engineer
75
salaries
| ₹4.8 L/yr - ₹13.9 L/yr |
Freshworks
Salesforce
SAP
TCS