Amadeus coding interview
questions, leaked.
4 problems reported across recent Amadeus interviews. Top patterns: array, simulation, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Amadeus interviews are tight. Four problems in the data set, split evenly between easy and medium, zero hard. Arrays dominate every single one, often paired with simulation or hash tables. You're looking at pattern-heavy assessment where the same data structure repeats across problems. If you can manipulate arrays under pressure and think through state transitions in real time, you're in position. If you hit a wall on the live OA, StealthCoder runs invisibly and surfaces a working solution in seconds, so you stay in control.
Top problems at Amadeus
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Watering Plants | MEDIUM | 100.0 | 80% | Array · Simulation |
| 02 | Two Sum | EASY | 87.0 | 56% | Array · Hash Table |
| 03 | Water Bottles | EASY | 70.8 | 71% | Math · Simulation |
| 04 | Minimum Time to Complete Trips | MEDIUM | 70.8 | 39% | Array · Binary Search |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Amadeus OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array3 · 75%
- simulation2 · 50%
- hash table1 · 25%
- math1 · 25%
- binary search1 · 25%
Arrays show up in three of four problems here, making it the absolute priority. Simulation appears twice and often rides on top of array logic, so those two topics bleed into each other. Hash tables, math, and binary search each appear once, which means they're the tactical surprises. Study arrays and simulation as your core prep, then spend targeted time on hash-table collision patterns and binary search on continuous answer spaces like time or water bottles. The medium problems (Watering Plants and Minimum Time to Complete Trips) will be where most candidates slow down. If you've drilled arrays hard and understand how to binary search on a manufactured constraint, you can walk through both. StealthCoder is your hedge if simulation logic gets slippery on the live assessment.
Companies with similar patterns
If you prepped for Amadeus, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Amadeus.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Amadeus interview FAQ
Should I spend most time on arrays for Amadeus?+
Yes. Arrays appear in 75% of their reported problems, often as the core data structure. Pair array drills with simulation logic since those topics intertwine here. Hash tables, math, and binary search are secondary. Master arrays first, then binary search on non-traditional domains like time or bottle capacity.
Is simulation a major topic for Amadeus interviews?+
It's significant. Simulation appears in half the problem set, always layered on top of array manipulation. Both easy and medium problems involve state transitions over time or iterations. Practice modeling real-world steps like plant watering sequences or water bottle refills before the OA.
How many hash-table problems should I expect?+
One, based on current data. Two Sum is the most straightforward hash-table classic. Don't over-invest here, but refresh the collision handling and two-sum pattern. The other problems depend on arrays and simulation, so prioritize those.
What's the hardest topic I'll face at Amadeus?+
Minimum Time to Complete Trips combines binary search with array logic on a continuous space. It requires thinking about time as an answer range, not discrete steps. Medium difficulty is the ceiling here, no hard problems reported. Binary search on manufactured constraints is the edge case to drill.
Is one week enough to prep for an Amadeus OA?+
Four problems and no hard tier is manageable. Spend three days on array fundamentals and simulation patterns, two days on binary search and hash tables. Run through all four problems twice, focus on Watering Plants and Minimum Time to Complete Trips, and you're solid. StealthCoder covers whatever gaps remain.