# Zoho Interview | Set 8 (On-Campus)

ROUND 1: Aptitude questions – both Quantitative aptitude and in programming. they were NOT MCQs

ROUND 2:
1. Arrange the numbers in descending order depending on the no. of factors available for each number.
I/P: {6,8,9}
O/P: {8,6,9} or {6,8,9}
Reason: factors of 8 (1,2,4,8), factors of 6 (1,2,3,6), factors of 9 (1,3,9).

2. Two strings of equal length are given print the mismatched ones.
I/P: a b c d e f g h i
a b d e e g g i i
O/P: cd , de //when two char are mismatched they should be printed together.
f , g
h , i

3. Get a number and check whether its palindrome do not use arrays and string manipulations
I/P: 5
O/P: 101-Palindrome
Reason: binary representation of 5 is 101 & it is a palindrome.
I/P: 10
O/P: Binary representation of 10 is 1010 â€“Not a palindrome

4. For any given matrix find the path from the start to the end which gives the maximum sum. Traverse only right or down.
Example: starting index is 15 (left top) and ending index is 10 (bottom right)
15 25 30
45 25 60
70 75 10
O/P:15->45->70->75->10 sum is 215

5. [ [â€˜Lavaâ€™ , â€˜kusha] ,
[â€˜Ramaâ€™ , â€˜Lavaâ€™] ,
[â€˜Lava â€˜,â€™Ravananâ€™] ,
[â€˜Abiâ€™ , â€˜Lavaâ€™] ]
First string is the child & the second string is the parent. Print the no. of grand children available for the
given I/P.
I/P: Ravanan
O/P: 2

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Previous
Next