The initial round was a phone interview with HackeRank of approximately 50min. The interviewer was helpfull and was okay with coding in the language you are comfortable with.Questions about previous projects, pointer and string functions of C were asked
Interview questions [1]
Question 1
Find the maximum difference in an unsorted array with the index of max greater than min. array cant be sorted
I applied online. The process took 4 weeks. I interviewed at Bloomberg
Interview
I was contacted by the HR for a technical phone interview. They missed our first appointment but it was rescheduled to a second in a couple of weeks. The interview itself was easy. However, the interviewer (I checked in Linkedin) seems to be confused. He started with a single linked list and want me to find a loop. I gave him an approach. Then he started to emphasis on a T- shaped link (?!). In such case how can the list be singly linked? In such case, won't the linked list become a tree?
I also aghast how they matched the interviewer with the interviewee. I have a PhD but the interviewer seems to be have a bachelor degree. While, the qualification doesn't matter there is big gap between the thinking of an undergraduate and a graduates (no offense).
I was not selected for further stages. Irrespective of the outcome, I would have been happier if I had been interviewed by a more competent person. I was interested in the job as it matched my skillsets and there is a lot for me to contribute to organization. However, such behavior makes one have second thoughts.
I applied through an employee referral. The process took 4 weeks. I interviewed at Bloomberg in Nov 2014
Interview
Referred on October 15th, got an email from HR on October 29th, scheduled a phone interview on November 20th.
Phone Interview. Start by asking about projects on my resume. Talked about two projects, one from my previous internship, using C++ and one in the school. Then start coding in HackerRank. Three coding problems in total -- merge sorted array, check if two trees are the same and validate if a tree is a binary search tree. Got one snippet of code in the end and asked me to think of test cases and fix the bug. It mainly completes the task to reverse integer. Give me time to ask questions about the company.
Interview questions [1]
Question 1
That would be fix the overflow issue in the last question