Mixed bag, totally depends on the team
Mixed bag, totally depends on the team
If you are in a good team, you get to learn a lot. It's not necessary that the tasks you perform will sound very cool or complex, but the way it gets executed at Amazon is really good.
Excessive competition results in a bad experience and unnecessary friction between team members. It is very difficult to win if you are not an extrovert.
It's not sure what domain you will end up working on, so getting into depth on something is difficult, but you do get to touch the breadth.
Additional Ratings
Was this helpful?
Amazon Interview Questions
Amazon Interview Experiences
SDE 1
The interviews begin with an introduction and then straight away dive into the fundamentals of C++. Going forward, most of the questions were about C++, like how things work at a low level.
SDE 1
I applied online. The process took 6 days. In 2026 they have changed the OA a little and have added behavioral as well. Do prepare for such scenarios. Rest the code was medium to hard 2 questions DSA.
SDE 1
1. Orange Cutting (Grid Simulation / BFS-Style) — 40 words Given an m×n grid where each cell has an orange with size. Cutting horizontally or vertically splits it into smaller valid pieces. Return the minimum number of cuts to make all pieces ≤ k. Us
SDE 1
Hyderābād, Telangana, IndiaSeptember 1, 2024The interviews begin with an introduction and then straight away dive into the fundamentals of C++. Going forward, most of the questions were about C++, like how things work at a low level.
SDE 1
Hyderābād, Telangana, IndiaMay 25, 2026I applied online. The process took 6 days. In 2026 they have changed the OA a little and have added behavioral as well. Do prepare for such scenarios. Rest the code was medium to hard 2 questions DSA.
SDE 1
Hyderābād, Telangana, IndiaDecember 10, 20251. Orange Cutting (Grid Simulation / BFS-Style) — 40 words Given an m×n grid where each cell has an orange with size. Cutting horizontally or vertically splits it into smaller valid pieces. Return the minimum number of cuts to make all pieces ≤ k. Us
