Zillious Interview Experience | Set 2 (On-Campus)
Recently Zillious visited our campus and take three rounds for final selection.
Written Round :
25 MCQ’s based on C & C++ output, OS, CN (40 min.)
2 Coding questions- ( On Paper – 1.5 hr)
1. You are given an array A of N integers. You are to fulfill M queries. Each query has one of the following three types:
C p : Rotate the array A clockwise by p units.
A p : Rotate the array A anticlockwise by p units.
R p : Query for the value of the element, currently being the p-th in the array A.
Input
The first line contains two numbers – N and M respectively.
The next line contains N space separated Integers, denoting the array A.
Each of the following M lines contains a query in the one of the forms described above.
Output
For each query of type R output the answer on a separate line.
Example
Input:
5 5
5 4 3 3 9
R 1
C 4
R 5
A 3
R 2
Output:
5
3
3
2. Find the longest substring which is palindrome.
First F2F (Technical):
1. Find next greater number with same set of digits
2. Minimum Number of Platforms Required for a Railway Station.
Given arrival and departure times of all trains that reach a railway station, find the minimum number of platforms required for the railway station so that no train waits.
3. Puzzle : Taking Seats on a Plane
Imagine there are a 100 people in line to board a plane that seats 100. The first person in line realizes he lost his boarding pass so when he boards he decides to take a random seat instead. Every person that boards the plane after him will either take their “proper” seat, or if that seat is taken, a random seat instead.
What is the probability that the last person that boards will end up in his/her proper seat.
4. Puzzle : 12 balls 3 weighing
Second F2F (Technical):
1. Imagine you have a special keyboard with the following keys:
A
Ctrl+A
Ctrl+C
Ctrl+V
where CTRL+A, CTRL+C, CTRL+V each acts as one function key for “Select All”, “Copy”, and “Paste” operations respectively.
If you can only press the keyboard for N times (with the above four keys), write a program to produce maximum numbers of A and also print out the sequence of keys.
2. Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words.
Consider the following dictionary
{ i, like, sam, sung, samsung, mobile, ice,
cream, icecream, man, go, mango}
Input: ilike
Output: Yes
The string can be segmented as “i like”.
Input: ilikesamsung
Output: Yes
The string can be segmented as “i like samsung” or “i like sam sung”.
Thank You GeeksforGeeks. 🙂
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
.png)
.png)