Amadeus prep

Amadeus Mid-level (3–5 years) Technical deep dive

#31

How does Node.js handle concurrent requests with a single thread? — Amadeus interview

Reported in Amadeus European engineering loops. Node.js architecture question on libuv, event loop phases, and worker threads.

Medium Read answer →

Amadeus Mid-level (3–5 years) Technical deep dive

#32

Compare ACID and BASE consistency models in databases — Amadeus interview

Reported in Amadeus European engineering loops. Distributed data question bridging SQL transactions and NoSQL eventual consistency.

Medium Read answer →

Amadeus Mid-level (3–5 years) Behavioral

#33

Tell me about a project that failed or missed its deadline. What did you learn? — Amadeus interview

Reported in Amadeus European engineering loops. Behavioral question testing accountability, retrospectives, and growth.

Medium Read answer →

Amadeus Mid-level (3–5 years) Technical deep dive

#34

How do you version a public API without breaking clients? — Amadeus interview

Reported in Amadeus European engineering loops. API evolution question covering compatibility, deprecation, and communication.

Medium Read answer →

Amadeus Mid-level (3–5 years) Technical deep dive

#35

What is dependency injection and why is it useful? — Amadeus interview

Reported in Amadeus European engineering loops. Java/Spring staple connecting OOP design to testable service architecture.

Medium Read answer →

Amadeus Mid-level (3–5 years) Coding / DSA

#36

How do you perform topological sort on a directed acyclic graph? — Amadeus interview

Reported in Amadeus European engineering loops. Graph algorithm for task scheduling, build systems, and course prerequisites.

Medium Read answer →

Amadeus Mid-level (3–5 years) Coding / DSA

#37

Explain minimum window substring sliding window approach — Amadeus interview

Reported in Amadeus European engineering loops. Advanced string window question seen in strong coding interviews.

Hard Read answer →

Amadeus Mid-level (3–5 years) Coding / DSA

#38

When would you use a Trie for prefix search? — Amadeus interview

Reported in Amadeus European engineering loops. Data structure trade-off question for autocomplete and dictionary lookups.

Medium Read answer →

Amadeus Mid-level (3–5 years) Coding / DSA

#39

How do you find median of two sorted arrays in log time? — Amadeus interview

Reported in Amadeus European engineering loops. Hard interview classic requiring binary search partition logic.

Hard Read answer →

Amadeus Mid-level (3–5 years) Coding / DSA

#40

Explain Union-Find for dynamic connectivity problems — Amadeus interview

Reported in Amadeus European engineering loops. Disjoint set union structure used in graph connectivity interviews.

Medium Read answer →

Amadeus Mid-level (3–5 years) System design

#41

How would you design a scalable file upload service? — Amadeus interview

Reported in Amadeus European engineering loops. Design question around large files, durability, and secure uploads.

Medium Read answer →