The entire interview was in Portuguese. It took almost 1 hour. First, the interviewer asked questions about my past experience, but he kept interrupting me when I was explaining the projects I've worked, so please be succint in this part. Next, he asked me to describe two data structures: binary search trees and hash maps. He asked questions about the Big-Oh details of these structures and where both could be applied in real world projects. Then he asked me to describe the various methods of handling hash collisions. Then he moved to the main part of the interview, the programming problem: "Given a list of integers that fall within a known short range of values (like 7 values), how to find the median value?". After he asked how I would solve it without initially knowing the range of values. The first one can be solved by simply couting using an array with length equal to the number of values. The complicated one can be solved by using a Selection algorithm (http://en.wikipedia.org/wiki/Selection_algorithm). I only gave a suboptimal answer to the complicated version of the problem. Also, I was very nervous and the interviewer kept interrupting me while I was talking. He had no patience at all and didn't let me think loud.

1 coding assessment. If you pass, you get to the final round which consists of 4 rounds in one day. 3 technical and one behavioral. The algorithms I had was BFS, Min heaps, and backtracking(parentheses)