J'ai postulé via une agence de recrutement. J'ai passé un entretien chez Amadeus (Sydney) en sept. 2017
Entretien
1.Resume Selection
2.Telephonic interview 45 min(about your past experience, Modern C++, Multithreading. Locking .. about the current job you have applied, work in the pipeline).
3. Face 2 Face onsite (Direct put the question and give 20 minutes to solve the problem on the whiteboard alone)
Questions d'entretien [3]
Question 1
White Board problem solving(20 Minutes)
Question and answers(10 Minutes)
Sort A tree of the string contains string as node like a madam , nathan, Ravi , Singh ... add a new world to this like maid .. so it add goes to first word after ma ..id .. in this way
First round was a coding OA, then I gave a quantitative aptitude test, then I attended an interview where they asked two coding questions and a lot of behavioural questions, this was an on campus process.
It was good with 3 round of interview. Solid questions of c++ and technical aspect. Questions was about critical thinking and details of c++. My prior experience was not mentioned at all.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Amadeus (Vellore) en août 2024
Entretien
The process was an on-campus recruitment drive for freshers. It has 2 online rounds, the 1st was a technical MCQ and DSA round. It has around 35 technical MCQs from various topics like Java, DBMS, OS, CN, Cloud, Ruby, R, Swift, Golang and 2 DSA easy questions.
The next online round was based on a shortlist from the above round and had only English aptitudes like passages, grammar and synonyms, antonym and a section of maths (mostly data interpretation).
The final was an HR plus technical interview and questions were based on the resume and core topics with a discussion and problem-solving of a few easy to medium-level DSA questions. Make sure to solve some puzzles from GFG as they also asked for puzzles and only selected applicants who could solve them.
Questions d'entretien [1]
Question 1
Which sorting algorithm is the fastest in term of TC ?