Meta

I gave my resume to a recruiter on campus and set up a phone interview. The interview was straightforward: an efficient string lookup from an array of strings (the type of questions that are solved using a trie). I thought I bombed the phone screen

First round - Interview on campus. 45 minutes long. Half of the interview consists of typical questions about your resume, what you know about the company, and what you do. The second half is a coding question given by the interviewer. Second round

1. Calculate the square root of a double. 2. Given n intervals [si, fi], find the maximum number of overlapping intervals. 3. Print all the paths from the root to every leaf in a binary tree. 4. Print the sum of all numbers at every vertical level