Met representatives at University Career Fair. Asked couple of questions about hashing and how to find the intersection of 2 linked lists in best running time. Got a mail couple of days later asking to set up a phone interview. Phone interview started off with resume analysis, asking me about my projects, in class and out of class. Went in depth so as to why I pursued those projects, and why I chose to employ a certain data structure (Why did you use the K-D tree to do the nearest neighbor search) Make sure you know your resume stuff very well. Went on to ask about all sorting algorithms I was aware of, and their best/average running times. Then came the most challenging part of the interview, the building question (detailed below) i don't think I did a very good job on that.. A week later got a thank you email telling me they had found another suitable candidate.