Zoho
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed in Jan 2023. There were 3 interview rounds.
Fully logical we want to strong in percentage and stream
We want to strong in one coding language and also u want to strong enough in DS algo
I applied via Company Website and was interviewed in Sep 2022. There was 1 interview round.
I have a Bachelor's degree in Computer Science.
Bachelor's degree in Computer Science
Completed courses in programming languages, algorithms, data structures, and software engineering
Participated in various coding competitions and hackathons
Aptitude test was of medium level with some pseudo-code o/p questions
Sort array based on frequency,etc
Top trending discussions
posted on 2 Jan 2023
I applied via Campus Placement and was interviewed in Jul 2022. There were 3 interview rounds.
posted on 20 Jul 2022
I applied via Company Website and was interviewed in Jun 2022. There were 4 interview rounds.
posted on 23 Nov 2022
I applied via Approached by Company and was interviewed in May 2022. There were 3 interview rounds.
I am currently working as a Software Development Engineer with expertise in web development and cloud computing.
Proficient in programming languages like Java, Python, and JavaScript
Experience in developing and maintaining web applications using frameworks like React and Angular
Knowledge of cloud computing platforms such as AWS and Azure
Familiarity with database management systems like MySQL and MongoDB
Strong problem-so
posted on 1 Nov 2022
I was interviewed in May 2022.
BST search time is O(log n) on average, but can be O(n) in worst case.
BST search time depends on the height of the tree
On average, height is log base 2 of n
Worst case is when the tree is unbalanced and height is n
Example: searching for a value in a balanced BST with 1024 nodes takes at most 10 comparisons
posted on 20 Aug 2022
I applied via Referral and was interviewed in Feb 2022. There were 3 interview rounds.
posted on 21 Nov 2022
I applied via LinkedIn and was interviewed in May 2022. There was 1 interview round.
The time complexity of the program is O(nlogn).
The program has a divide and conquer algorithm.
The program has nested loops.
The program has a recursive function.
Design an algorithm with less time complexity.
Use efficient data structures like hash tables, binary trees, etc.
Avoid nested loops and recursion if possible.
Try to optimize the code by reducing redundant operations.
Use dynamic programming to solve complex problems.
Consider parallel processing for large datasets.
Use built-in functions and libraries instead of writing custom code.
Profile the code to identify bottlenecks
posted on 28 Aug 2021
I applied via Company Website and was interviewed before Aug 2020. There was 1 interview round.
Interview experience
based on 1 review
Rating in categories
Member Technical Staff
1.4k
salaries
| ₹5.6 L/yr - ₹23 L/yr |
Technical Support Engineer
538
salaries
| ₹2.5 L/yr - ₹11 L/yr |
Software Developer
404
salaries
| ₹5 L/yr - ₹19 L/yr |
Software Engineer
85
salaries
| ₹4.7 L/yr - ₹15.5 L/yr |
Web Developer
79
salaries
| ₹3.5 L/yr - ₹12.3 L/yr |
Freshworks
Salesforce
SAP
TCS