RIT

AD

01.02.2025

Value Added Course on JAVA

Program practice Excercises

Zoho Interview Questions (Round 2)

1. Write a progr`am to give the following output for the given input

Eg 1: Input: a1b10
Output: abbbbbbbbbb
Eg: 2: Input: b3c6d15
Output: bbbccccccddddddddddddddd
The number varies from 1 to 99.
2. Write a program to sort the elements in odd positions in descending order and
elements in ascending order

Eg 1: Input: 13,2 4,15,12,10,5

Output: 13,2,12,10,5,15,4

Eg 2: Input: 1,2,3,4,5,6,7,8,9

Output: 9,2,7,4,5,6,3,8,1

3. Write a program to print the following output for the given input. You can assume the
string is of odd length

Eg 1: Input: 12345
Output:
1 5
2 4
3
2 4
1 5
Eg 2: Input: geeksforgeeks
Output:
 g s
e k
e e
k e
s g
f r
o
f r
s g
k e
e e
e k
g s

4. Find if a String2 is substring of String1. If it is, return the index of the first
occurrence. else return -1.

Eg 1:Input:
String 1: test123string
String 2: 123
Output: 4
Eg 2: Input:
String 1: testing12
String 2: 1234
Output: -1
5. Given two sorted arrays, merge them such that the elements are not repeated

Eg 1: Input:
Array 1: 2,4,5,6,7,9,10,13
Array 2: 2,3,4,5,6,7,8,9,11,15
Output:
Merged array: 2,3,4,5,6,7,8,9,10,11,13,15
6. Find the occurrence of a number and display the values in ascending order of the
given input

Ex input 3 4 3 4 1 2 3 1 2
Output 2 2 3 2

7. Alphabets are inside () and the number -9<=0>=9 which is under{} solve the string
according to the sample input output

Input (z){-2}oho

Output ZZoho

Input ((X){2}(y){3}(z)){2}

Output xxyyyzxxyyyz

8. a. email id can have alphabets numbers replace la email ID with 5 stars () should
have domain name
Example input [email protected]
Output [email protected]
B. Phone number should have + at 1st and should have 2 numbers
and a hypen – and 10 numbers 1st 6 numbers should replace with 5
stars..
In the 10 number can have – or () it can be negligible
Example input +91-1234567890
Output +91-7890
+91-(123)(234)(6789)
+91-6789

9. Given N candies and K people. In the first turn, the first person gets 1 candy, the
second gets 2 candies, and so on till K people. In the next turn, the first person gets
K+1 candies, the second person gets K+2 candies and so on. If the number of candies
is less than the required number of candies at every turn, then the person receives the
remaining number of candies. Find the total number of candies every person has at the
end.
Example 1:

Input:
N = 7, K = 4
Output:
1231
Explanation:
At the first turn, the fourth person
has to be given 4 candies, but there is
only 1 left, hence he takes only one.

Example 2:
Input:
N = 10, K = 3
Output :
523
Explanation:
At the second turn first one receives
4 and then we have no more candies left.

Your Task:
You don't need to read input or print anything. Your task is to complete the function
distributeCandies() which takes 2 integers N and K as input and returns a list, where
the ith integer denotes the number of candies the ith person gets.
Expected Time Complexity: O(logN+K)
Expected Auxiliary Space: O(K)
Constraints:
1 ≤ N ≤ 108
1 ≤ K ≤ 100

10. Given an array A of positive integers. Your task is to sort them in such a way that the
first part of the array contains odd numbers sorted in descending order, rest portion
contains even numbers sorted in ascending order.

Example 1:

Input:
N=7
Arr = {1, 2, 3, 5, 4, 7, 10}
Output:
7 5 3 1 2 4 10
Explanation:
Array elements 7 5 3 1 are odd
and sorted in descending order,
whereas 2 4 10 are even numbers
and sorted in ascending order.

Example 2:

Input:
N=7
Arr = {0, 4, 5, 3, 7, 2, 1}
Output:
7531024

Your Task:
You don't need to read input or print anything. Your task is to complete the function
leftIndex() which takes the array Arr[] and its size N as inputs and modifies the array
Arr[].
Expected Time Complexity: O(N. Log(N))
Expected Auxiliary Space: O(N)
Constraints:
1 <= N <= 106
0 <= Ai <= 1018
11. Given a non null integer matrix Grid of dimensions NxM.Calculate the sum of its
elements.

Example 1:

Input:
N=2,M=3
Grid=
[[1,0,1],
[-8,9,-2]]
Output:
1
Explanation:
The sum of all elements of the matrix is
(1+0+1-8+9-2)=1.

Example 2:

Input:
N=3,M=5
Grid=
[[1,0,1,0,1],
[0,1,0,1,0],
[-1,-1,-1,-1,-1]]
Output:
0
Explanation:
The sum of all elements of the matrix are
(1+0+1+0+1+0+1+0+1+0-1-1-1-1-1)=0.

Your Task:

You don't need to read input or print anything.Your task is to complete the function
sumOfMatrix() which takes two integers N ,M and a 2D array Grid as input
parameters and returns the sum of all the elements of the Grid.

Expected Time Complexity:O(N*M)

Expected Auxillary Space:O(1)

Constraints:

1<=N,M<=1000

-1000<=Grid[i][j]<=1000

12. Write a program to print the probability of positive number, neutral number and
negative number present in the array.

Input: [2,1,0,-8,-9]

Output: 0.4 , 0.2 , 0.4

Explanation:
First, find the total number of elements in the array = 5
Find the total number of positive numbers=2
Find the total number of neutral numbers=1
(0 is the only neutral number)
Find the total number of negative numbers=2
 Output = [ (no of positive number/length of array), (no of neutral numbers/length of
array), (no of negative numbers/length of array) ]
=[⅖, ⅕, ⅖]
=[0.4, 0.2, 0.4]

12. Write a program to rearrange the array in such a way that the first element is first
maximum and second element is first minimum.
Input: 1 2 3 4 5 6
Output: 6 1 5 2 4 3
13. Write a program to find the output based on the given array and threshold value.
Example
Input: Array 5 8 13 6 2
Threshold : 3
Output: 17

Number Parts Count

5 3,2 2
8 3,3,2 3
10 3,3,3,2 4
13 3,3,3,3,1 5
6 3,3 2
2 2 1
Total Count=17

Zoho Interview Questions (Round 3)

1) Design a Call taxi booking application

-There are n number of taxi’s. For simplicity, assume 4. But it should work for any
number of taxi’s.
-The are 6 points(A,B,C,D,E,F)
-All the points are in a straight line, and each point is 15kms away from the adjacent
points.
-It takes 60 mins to travel from one point to another

-Each taxi charges Rs.100 minimum for the first 5 kilometers and Rs.10 for the
subsequent kilometers.
-For simplicity, time can be entered as absolute time. Eg: 9hrs, 15hrs etc.
-All taxi’s are initially stationed at A.
-When a customer books a Taxi, a free taxi at that point is allocated
-If no free taxi is available at that point, a free taxi at the nearest point is allocated.
-If two taxi’s are free at the same point, one with lower earning is allocated
-Note that the taxi only charges the customer from the pickup point to the drop
 point. Not the distance it travels from an adjacent point to pickup the customer.
-If no taxi is free at that time, booking is rejected

Design modules for

1) Call taxi booking
Input 1:
Customer ID: 1
Pickup Point: A
Drop Point: B
Pickup Time: 9

Output 1:
Taxi can be allotted.
Taxi-1 is allotted

Input 2:
Customer ID: 2
Pickup Point: B
Drop Point: D
Pickup Time: 9

Output 1:
Taxi can be allotted.
Taxi-2 is allotted
(Note: Since Taxi-1 would have completed its journey when second booking is
done, so Taxi-2 from nearest point A which is free is allocated)

Input 3:
Customer ID: 3
Pickup Point: B
Drop Point: C
Pickup Time: 12

Output 1:
Taxi can be allotted.
Taxi-1 is allotted
2) Display the Taxi details
Taxi No: Total Earnings:
BookingID CustomerID From To PickupTime DropTime Amount

Output:
Taxi-1 Total Earnings: Rs. 400

1 1 A B 9 10 200
3 3 B C 12 13 200

Taxi-2 Total Earnings: Rs. 350

2 2 B D 9 11 350

2. We have to develop a simple railway ticket booking application. Develop a Railway

Reservation Application contains

1.AC coach

2.Non AC coach

3. Seater

Each should contain 60 seats and 10 waiting list max allowed rest request should be
cancelled.

you should have

1.Ticket Booking

2.Ticket Cancellation

3.Status Checking