Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Amadeus (Antibes) nel mese di ott 2018
Colloquio
1. Entretien téléphonique : présentation d'Amadeus et présentation du candidat, tout en anglais
2. Tests en ligne (Développement C++ sur Codin Game + questions sur le langage C++ et sur la conception logicielle), test d'anglais, test de personnalité)
3. Entretiens dans les locaux d'Amadeus à Sophia Antipolis. Il y en a eu 5 pour ma part avec 5 personnes différentes (RH, chefs de services, chefs de projet)
4. Réception d'une proposition suite à la réussite de ces entretiens
Ho sostenuto un colloquio presso Amadeus (Bengaluru)
Colloquio
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.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Amadeus (Vellore) nel mese di ago 2024
Colloquio
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.
Domande di colloquio [1]
Domanda 1
Which sorting algorithm is the fastest in term of TC ?