the first two interviews are technical interviews, they asked me to explain what is linker, pointer and to find a way to implement a dictionary for 1,000,000 words in the best complexity. in the second interview they asked me to implement a swap function, a recursive function which find the height of a binary tree and then a function which find the longest path. the thied and last interview is a managment interview in which they asked you about youeself, about cources that you loved the most and more. after passing the three interviews successfully you get an offer.