Interview Experience 77

#2017

##SoftwareEngineer

1. Qualifying Round - Pen & Paper coding round (Questions given here - http://www.geeksforgeeks.org/factset-interview-experience-set-9-campus-full-time/)

2. 1st Technical Round -

Implement 'atoi' function of C on your own. Deal with all corner cases. The more corner cases one can think, the better it would be. Some corner cases include - invalid characters, redundant spaces/leading zeroes, integer overflow, etc.

Given a url, replace all the spaces in them with string ""%20"", in constant space assuming that there are sufficient spaces left in the end to accommodate the extra characters.

Given a Binary Tree. You need to check if its a Perfect Binary Tree or not without using any extra space, recursion or anything.

3. 2nd Technical cum HR round -

Started with a bit of tricky HR questions like What is special about you?

Further discussion on the previous Perfect Binary tree question as my previous solution was missing few corner cases.

Given a string, find frequencies of all characters in the string.

Given a matrix (NxN) which is row-wise and column-wise sorted. Now print the elements present in the matrix in sorted order. Constraints – Space complexity not greater than O(N). (N is the no. of rows, not the entire matrix size).

Few 'C' language based questions like difference between const int *ptr & int const *ptr"