Amadeus Interview Questions, Process, and Tips

Test was on HackerRank with a duration of 90 minutes. It contained around 25 aptitude and 2 coding questions.

Aptitude on SHL platform. Each question had a time constraint and you cannot navigate back to the previous question. Would recommend to give a demo SHL test before taking the actual test.

Q1. This was a panel round with HR and technical lead.
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 mcqs on SQL were also present.

This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and maths because many questions were to be done in 1 hour.

Q1. 
Matrix Transformation Problem Statement
Given a 2-dimensional matrix of size NxN containing 0s and 1s, the task is to modify the matrix such that, if an element is 1, set its entire row and column to 1. I...read more
Ans. 
Modify a matrix by setting entire row and column to 1 if an element is 1, then count the number of 1s.
• Iterate through the matrix to find elements with value 1

• Use two arrays to keep track of rows and columns to be modified

• Update the matrix by setting entire row and column to 1 if an element is 1

• Count the number of 1s in the modified matrix
Answered by AI
Add your answer

Round duration - 55 minutes
Round difficulty - Medium

It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

Round duration - 90 Minutes
Round difficulty - Medium

It was an online technical round. There were around 20 MCQs and two coding questions. The round had an login window of 30 minutes. One coding question was of the level leetcode medium and the other was leetcode hard.

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted N * N matrix, find the position of a target integer X.
• Iterate over each row and column to search for the target integer

• Utilize the sorted nature of the matrix to optimize the search process

• Return the position of the target integer if found, else return -1 -1
Answered by AI
Add your answer
Q2. 
Euler’s Totient Function Problem Statement
Given an integer N, your task is to determine the count of integers between 1 and N (inclusive) that are coprime to N.
Input:
The first line contains an intege...read more
Ans. 
Euler's Totient Function calculates count of integers coprime to N between 1 and N.
• Implement Euler's Totient Function to calculate count of coprime integers to N.

• Use the formula: phi(N) = N * (1 - 1/p1) * (1 - 1/p2) * ... * (1 - 1/pk) where p1, p2, ..., pk are prime factors of N.

• Example: For N = 9, phi(9) = 9 * (1 - 1/3) = 6.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a technical + HR round. The interview panel consisted of two technical guys and one person from HR.

Q1. 
Sort Array of Strings Problem Statement
Given an array of strings ARRSTR[] of size N, and a character C, your task is to sort the ARRSTR[] array according to a new alphabetical order that starts with the ...read more
Ans. 
Sort an array of strings based on a new alphabetical order starting with a given character.
• Iterate through the array of strings and compare each string with the given character to determine the new order.

• Implement a custom comparator function to sort the strings based on the new alphabetical order.

• Use built-in sorting functions in programming languages like Python, Java, or C++ to efficiently sort the array.
Answered by AI
Add your answer
Q2. Can you explain the pillars of Object-Oriented Programming (OOP)?
Ans. 
The pillars of OOP are Inheritance, Encapsulation, Abstraction, and Polymorphism.
• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation restricts access to certain components of an object, protecting its integrity.

• Abstraction hides complex implementation details and only shows the necessary features.

• Polymorphism allows objects to be treated as instances of their parent class, ena
Answered by AI
Add your answer

Round duration - 100 Minutes
Round difficulty - Medium

Started at 11 am. The test comprised of 2 codes, and mcqs with questions on technical cs, verbal ability, mathematical reasoning (more emphasis on data structures).

Q1. 
Spiral Matrix Problem Statement
You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.
Input
The first line contains an integer 'T' which denotes the nu...read more
Add your answer
Q2. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The platform was hackerearth. It was a technical interview+ hr.
The panel consisted of 2 people. One form tech another from hr. The tech person reviewed questions from first round. And gave questions on coding. HR round was taken just after the tech was over.

Q1. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Add your answer
Q2. 
Rearrange The Array Problem Statement
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
Example:
Inpu...read more
Add your answer