# Accolite Interview Experience | Set 13 (On-Campus for Internship and FTE)

Last Updated : 28 Jun, 2021

Accolite visited our campus for recruiting Full time employees as well as interns. The process started with pre-placement talks and then we had to undergo a 5-round process.

Round 1: Online (30 min)
The first round was conducted online,which consisted of MCQ’s covering C,Â C++, OS, DBMS. We had to answer 20 questions, and yes there was a negative marking (-0.25) for each wrong answer.
Around 650 people took the online test and 75 people were selected for the next round.

Round 2: Paper Coding (1 hr)
We were asked to code the following questions on paper:
1. Print shortest path to print a string on screen
2. Find zeroes to be flipped so that number of consecutive 1â€™s is maximized
3. Serialize and Deserialize a Binary Tree

Out of the 75 people who took this test 20 were shortlisted.
We then had 3 technical interviews on the next day.

Round 3: F2F interview (2 hrs)
I was the first person to be shortlisted and so I was interviewed by the Senior Technical Director of the company. She asked me about my favorite data structure to which I replied Trees. So she asked me to do a zig-zag level order traversal of a binary tree.

1. Â Level order traversal in spiral form
2. She then gave a string in the encoded form and asked me to find the k’th character in the string without decoding it.
For example:
Input: Encoded string is “a9b21c5” and k=27
Output: ‘b’
3. She then gave me a real-time problem which she faced last week and asked me to provide a solution and code it.

Round 4: F2F interview(1.30 hrs)
The interview asked me to code the following questions:

1. Â Trapping Rain Water
2. Â Given a linked list and an integer ‘k’, I had to rotate the linked list.(Note: Reversing a linked list is different)
Input : 1->2->3->4->5->6->7->8->9->10 and k=4
Output: 4->1->2->3-> 8->5->6->7->9->10
3. Â He gave me a string represented by a binary tree(each leaf node is a character) and a random function that might swap any number of internal nodes of the binary tree(just like mirror). I had to find out if the string (represented by the tree)returned after the randomized function call is a valid permutation of the original string.
Eg: Input: “golden” and “gloned” where gloned is the string returned after calling randomized function.
Output: True
Input: “golden” and “gnlode”
Output: False

Round 5: F2F interview(1.30 hrs)
The interviewer gave me two scenarios and asked me to write an algorithm for both.
Scenario 1:
I had to reach Paris from Chennai by flight. He wanted me to find the best possible way to reach Paris. I told him that I would use Djikstra’s algorithm based on distance, one solution based on time and one solution based on both distance and time(using weighted averages). He then asked me to minimize the number of points to be considered at each intermediate vertex. I told him to use the latitude and longitude to find the direction of the destination and consider points accordingly. He then asked me to draw a line between the source and destination and asked me to consider only points which were inside an inclination of 30 degrees of the line drawn. I gave him a solution and he was satisfied.

Scenario 2:
He asked me to assume there were 100 airports in my city and he asked me to suggest an algorithm for choosing the airport given the destination and the timings of each flight at each airport. He then asked me to incorporate the significance of “traffic” while I travel from my current location to the airport and asked me to design accordingly. He asked me if I had any questions for him, to which I posed a lot of questions regarding the company’s structure, clients and any pre-requisites to be learnt before I could join the company.

The results were anounced later in the evening and I got selected!!!