Amadeus Member Technical Staff Interview Questions, Process, and Tips

Oracle RDBMS concepts, core java, data structures

Q1. More like a discussion
Add your answer

It was basic DSA round consisting of DP question and Graph question.

Q1. 2 Technical Rounds with standard DSA of around 1300 codeforces level. OS was also asked.
Add your answer

Q1. Final HR round asking general questions about myself and my future goals.
Add your answer

Hackker Rank test with 20 MCQ and 2 coding questions

Coding Interview question - ugly number, kadane algorithm

More coding questions with LRU and Design a data structure with o(1) insertion, deletion, search time and few technical questions

Q1. Questions regarding previous project experience.
Add your answer

Q1. 1 DSA question and questions based on project and some puzzles as well as some one word answers.
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

The round was audio and video proctored, since it was virtual.
It lasted for 90 minutes.
The questions was of medium level.

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. Palindromic String
In this method, Before we start let us define what is the right half (or right part) and what is left half (or left part) in the string. There can be two cases based on the length of the string:
 
• Case-1: (Odd length string), consider the string “1234567”, the part of the string “123” is the left part(or left half) and the part “567” is the right part(or right half), and the one left(4) is called t...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was Technical round of 60 minutes,
the interviewer was very nice person.

Q1. 
Check Permutation Problem Statement
Given two strings 'STR1' and 'STR2', determine if they are anagrams of each other.
Explanation:
Two strings are considered to be anagrams if they contain the same cha...read more
Ans. Brute-Force
The basic idea of this approach is to sort both the strings and compare the characters of the sorted strings.
• Sort both strings.
• Compare the characters of the sorted strings.
Space Complexity: O(logn)Explanation:
O(1)
 
Since we not using any extra space, the overall space complexity will be O(1).
Time Complexity: O(nlogn)Explanation:
O(N * log(N)), Where ‘N’ is the length of the strings.
 
Since we are so...read more
Answered Anonymously
Add your answer
Q2. Which data structure would you use to implement the undo and redo operation in a system?
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a resume based Interview round technical - 2
the interviewer was helping and humble.

Q1. Can you design the bank architecture using basic OOP concepts in any programming language?
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

It was the easiest round.
And it was supposed to be the same.
It was an HR round.