Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Orbitz Worldwide (Chicago, IL)
Colloquio
I met the recruiting team on campus and had a campus interview the next day. The questions were some typical behavior questions plus two basic algorithm questions. Then I was moved forward to the next step to complete a coding challenge within 2 days and had the onsite interview finally. There were two stages in the onsite interview. One was behavior and the other was technical. The technical problems weren't so hard, just make sure that you present your idea clearly.
The people there were really kind and nice. I felt comfortable during the whole interview process and didn't felt stressed nor exhausted. However, I decided to accept another company's offer so I decline it.
Domande di colloquio [1]
Domanda 1
What's your stressed out experience and how did you solve that?
Have you ever planned out something and achieved that goal successfully?
How do you handle conflicts with your teammates?
Given two strings s and t, determine if they are isomorphic.
Given some constraints, check the validity of a password.
Construct Binary Tree from Preorder and Inorder Traversal
Some questions about hashmap.
Great interview process. Questions were simple. The interview felt much more like a conversation than an interview which was great. It seems like HR here have an understanding of what the role needs.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Orbitz Worldwide (Chicago, IL) nel mese di feb 2016
Colloquio
The on-site interview includes 2 rounds. The first round asked me some behavior questions, like how to deal with the relationship between you and colleages or you and supervisors. And the second round asked me some technical questions like Java basic and algorithm. And I was given a paper to wirte down the pseudocode about the question.
Domande di colloquio [1]
Domanda 1
Given a linkedlist, find the NO.n element from tail.
