My Interview Experience- Accolite Total Rounds: 1 Written 3 technical 1 HR First Round Written Most questions on DS (time complexity, hash

h code, binary tree) Second Round Technical 1. Tell me about your self 2. A linked list of contains characters. Find all whether the characters form a palindrome or not in just 2 passes without distorting the linked list. I could not answer this and I even doubt its possibility. But told him all other possible ways of doing it. 3. Given a circular ordered array eg: 8,9,10,1,2,3,4,5,6,7. Search for a number in least time? I modified binary search a bit by not only comparing the middle element but also the first element. 4. Given a binary tree (not complete binary) print the alternate corners. This also I told him all possible cases to be consider. On way is to Travers in a zig-zag way and then print the corners. But he wanted an answer without traversing the complete tree. 5. Display all the possible palindrome in a given string. Ex: abccabc abccabc, abc,abc,cc Third Round Technical 1. Explain a technically challenging project that you have done 2. Explain Mini Google 3. Assume you are developing a paint application and write a code for color filling (consider 0 white and 1- black) assume that the whole white screen is a multi-dimensional array and the user clicks randomly in an area and we have to fill the bordered area, recursively fill (x,y+1),(x,y1),(x+1,y),(x-1,y) location and add filled location in hashmap and do no fill already filled area. Fourth Round Technical 1. You have a well which is made of rims with uniform outer diameter and varying inner diameter. You are given solid disks to through into the well. Write a function that tells whether the disk can be thrown into the well or not. First used brute force, later he suggested dynamic programming. Then I explained him the approach. HR No question. They kind of gave a corporate PPT.