Aslam - Zoho Interview Experience

 Name:  Jainul Aslam M

Department:  BTECH Information Technology.

College: SASTRA UNIVERSITY

Email ID: mjainulaslam@gmail.com

Company Name: Zoho Corporation

Designation: Member Technical Staff

Eligibility criteria

○ CGPA: 5.5 and above

○ Department:  All Department

● Round details

○ No. of rounds :  5

○ Topics to concentrate on : C,C++ , Data Structures.

● Questions asked in each Round :

           
          DAY 1 :   
                 Round 1 :

Round 1 has written test – aptitude and C. We had 30 questions – 15 from aptitude and 15 from C.  First 10 questions in each part carries 1 mark , the last 5 questions carries 2 marks.  One bad news is “it is not a multiple choice question”.

Aptitude – Fully Logical Questions.

C  - Mostly From Pointers

                  At the end of DAY 1, we got first round RESULT.


           DAY 2 :   

               Round 2 :

It’s a programming round you will be given 5 programs, you have to get the expected output for all test cases. You will be given 3 hours to solve these problems.

Question 1: Given a sentence, find the maximum possible palindrome found in the sentence. In case of two or more possible choice, print any one choice.

Example:

          Sentence : sastra university

          Output :    sartinitras

Question 2: Given a linked list, find the k’th element from the end of linked list. (Use Only one loop)

Example:

          List : 1->2->3->4->5->6->7->8

          Kth Position : 3

          Output :    5

Question 3: Find the maximum contiguous subarray sum of a given array, considering only positive numbers as contiguous. Also print the elements which forms the maximum sum. (Use Only one loop)

Example:

  Array : {1,-3,0,4,5,6,-1,9,0,1,4,-5,11}

  Output : 15  {0,4,5,6}

Question 4: Given a linked list containing 0’s , 1’s and 2’s , Display the output such that all 0’s should occur at first , all 1’s should occur next , atlast all 2’s should occur. (Use Only one loop)

Example:

  List : 0->2->1->2->2->0->0->1->1->2->1->1->0

  Output : 0->0->0->0->1->1->1->1->1->2->2->2->2

Question 5: Print the given array based on decreasing frequency of element in an array.

Example:

  Array : {1,0,0,1,2,5,6,7,8,2,2,4,6}

  Output : {2,2,2,1,1,0,0,6,6,4,5,7,8}

I got output for all programs in ROUND 2.

                  At the end of DAY 2, we got second round RESULT.

          DAY 3 :   

             Round 3 :

It’s advanced programming round you will be given one big program, you have to get the expected output for all test cases. You will be given 3 hours to solve these problems.

Question:  There are ‘n’ taxi and 5 stations named A,B,C,D,E. The distance between each neighbouring station is 15 km. The time taken to reach each neighbouring station is 30 minute. The amount for travelling first 5km is RS. 15 for each km, from 6^th km, amount is RS. 7.5 for each km. Passenger will enter their current location, destination station and time, the system should display the available taxi in that given time.

Assume Initially all taxi is in Station A.

                  

At the end of the day, display the history of each taxi   with the location and time.

Constraints:

à     When a taxi is used by some passengers, the particular taxi should not be considered for suggestion.

à      If a taxi is not available in the passenger location, suggest a taxi which is available nearby station.

à     If two taxi are available @ a particular location, suggest a taxi which has low pay earned for the day.

à      Note: Write a general case that works for any number of cars.  Get the value of ‘n’ from the user during runtime.

Example:

  Current Location : A

  Destination : B

  Time : 8:30am

Taxi Suggested for you :  TAXI 1

  Current Location : A

  Destination : C

  Time : 9am

Taxi Suggested for you :  TAXI 2

  Current Location : D

  Destination : B

  Time : 10:30am

Taxi Suggested for you :  TAXI 2

  Current Location : B

  Destination : A

  Time : 1:30pm

Taxi Suggested for you :  TAXI 1

..........................................

Display the history in the given format:

From Station	TO Station	TIME	Taxi Number

Luckily my program satisfied all test cases(nearly 10).

               Round 4 : Technical Interview – C,C++,Java, Data Structures , DBMS.

                   The most common questions:

                             * SQL Queries.

                             * JAVA Concepts

                             * OOPS

               Round 5 : HR Interview – Not that much tough! He asked about my projects and about my college days.

            At the day of DAY 3 , we got overall selected student list.

● Interview Experience

○ What did they ask from Resume?

          à Area of Interest

          à Projects

          à ExtraCurricular Activities.

○ Personal Feedback

          If you are good at coding , you can easily clear these interview. They are checking your logic, not the code!

● From where to prepare?

          If you have the basic knowledge of C,C++, that’s more than enough.

                Some Links.

                             à GeeksforGeeks

                             à CarrerCup

                             à Indiabix (Apti & Interview Question)