i
Amadeus
Filter interviews by
Total 31 questions where 29 are MCQ related to Java, c++, python (to find output or time complexity) and 2 are coding questions with medium difficulty
I applied via campus placement at Nitte Meenakshi Institute of Technology, Bangalore and was interviewed before Sep 2022. There were 4 interview rounds.
[ON CAMPUS] It was about 50 MCQs + 2 Coding Problems
The first section of MCQs were based fundamental CS concepts like OOP, Computer Networks, DBMS, OS etc. The second section had code snippets and questions included to predict the output,
find the error statement, fill in the blanks etc.
Each candidate received different set of questions. Most of the questions were based on arrays, strings, stack and queue. I was asked the following two questions: Minimum Platform (GFG) and Valid Parentheses (LeetCode).
This round had 2 sections. First section had questions on data explanatory, data visualization, data interpretation, math, statistics etc. Second section was about English. Overall the questions were slightly difficult. This round was challenging because the time allotted to each section was very less.
I applied via campus placement at Thapar Institute of Engineering and Technology (TIET) and was interviewed before May 2023. There were 3 interview rounds.
A Small Aptitude test
A simple string question
I applied via campus placement at Guru Gobind Singh Indraprastha University (GGSIU) and was interviewed before Apr 2021. There were 3 interview rounds.
MCQs based on OS, DBMS, Networks and 2 coding questions based on linked lists and trees.
MCQ Questions based on Data Interpretation, very limited time for the test. 25 questions in 30 minutes.
Amadeus interview questions for designations
posted on 19 Mar 2024
I applied via Campus Placement and was interviewed before Mar 2023. There were 2 interview rounds.
HackerRank platform of 1 hr
I applied via Campus Placement
Question related to operating system and computer network
Traverse all child nodes in a tree data structure
Use depth-first or breadth-first traversal algorithms
Recursively visit each child node starting from the root node
Consider using a stack or queue data structure for traversal
Example: Traverse all nodes in a binary tree
posted on 29 Nov 2024
I applied via Naukri.com and was interviewed in Oct 2024. There were 3 interview rounds.
SQL query to retrieve student department id.
Use SELECT statement to retrieve data
Specify the columns to be selected, including the department id column
Specify the table where the student data is stored
Use WHERE clause to filter the results based on student information
Code to find index of sub string in main string and duplicate the sub string
Use a loop to iterate through the main string and check for the sub string
If sub string is found, duplicate it and store the index
Return the index of the duplicated sub string
Written coding test
Basic coding questions
Only c c++
Easy level
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
In first round 4 coding question like 1 dsa 2 database and one is api and question is very simple . coding round was conducted in hackerrank
Again same but dsa question and oops concept in deep level
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
It included aptitude, technical and coding questions
Remote work preferred, open to occasional travel
Remote work preferred
Open to occasional travel
Flexible with location
based on 3 interviews
Interview experience
based on 3 reviews
Rating in categories
Senior Software Engineer
605
salaries
| ₹11.1 L/yr - ₹33.3 L/yr |
Member Technical Staff
316
salaries
| ₹14.9 L/yr - ₹42.5 L/yr |
Software Engineer
219
salaries
| ₹5.9 L/yr - ₹21 L/yr |
Senior Business Analyst
182
salaries
| ₹10.5 L/yr - ₹25 L/yr |
Software Development Engineer II
182
salaries
| ₹12 L/yr - ₹26.8 L/yr |
Sabre
Travelport
Expedia Group
Booking Holdings