I applied for the position before christmas, and got the letter 3rd of january that i have 2 phone interviews 10th of january. So i didn't have a lot of time to study. The first interview was really good, basic questions about the work experience, projects. After that there were technical questions. Like when do we use arrays and when do we use linked lists. Couple of other theoretical questions. Then the interviewer asked how to find if there are numbers that repeat in an array. I had to give three different solutions before we came to the one that has the best order complexity. So my advice is to study the big O notation. Then she asked how to reverse a singly linked list. i gave the answer. The second interview was more difficult for me, because i didn't study BSTs at all, i focused completely on hash tables. But the guy asked of how to find repeated characters in a string, so i had to give 2 solutions. One was less space consuming but more time consuming, the other one was the opposite. but apparently there was one solution that was perfect, didn't get it. The other question was about printing the BST in level order. Couldn't do it... but overall both interviewers were polite and helpful, so i guess studying the data structure book is very helpful.