Amazon Interview Questions — Page 148

Amazon·Data Scientist·Onsite - Behavioral / Leadership

Jul 2026

Virtual behavioral interview for a Data Scientist intern role at Amazon. Pretty much wall-to-wall leadership principle questions, which I knew was coming but still felt like a lot to juggle in one sitting. No technical questions at all, just story after story.

Walk me through your most recent project.
Tell me about a time you took a calculated risk.
Describe a situation where you had to push back a deadline.
Tell me about a time you made a fast decision without having all the information you needed.
Tell me about a time you persuaded teammates who initially disagreed with your approach.
Describe an experience where you led a team.
Tell me about an unexpected obstacle you ran into and how you handled it.
Tell me about a time you had to pick up a completely unfamiliar skill or topic.
Why do you want to work at Amazon specifically?
Why are you interested in this data scientist internship in particular?

“This was my opener and I rambled way too much on context.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jul 2026

Interviewed for a solutions architect role at Amazon. One technical concept question, pretty short session from what I can tell.

What is caching and why is it needed?

“Seemed basic but I second-guessed myself halfway through.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Jul 2026

Amazon SDE coding round, two problems back to back with complexity discussion after each. Nothing too wild but the follow-ups caught me a little off guard.

Design an LRU cache with get and put operations, both running in O(1) time.
Given n nodes and a list of undirected edges, count the number of connected components in the graph.
How would you make the LRU cache thread-safe, and where would lock contention become a bottleneck?
How would you extend the LRU cache to use a least-frequently-used eviction policy while keeping all operations O(1)?
If graph edges arrive as a stream rather than all at once, which approach scales better between DFS and Union-Find?

“I knew this one going in but still fumbled the eviction logic at first.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jul 2026

Amazon SWE coding round, just the one question about stock prices. Pretty standard dynamic programming territory but I fumbled my way through it more than I'd like to admit.

Given an array of daily stock prices, find the maximum profit possible from a single buy-and-sell transaction. You cannot sell before you buy.

“I knew this one but still managed to overcomplicate it at first.”

View Post

Amazon·Data Scientist·Onsite - Behavioral / Leadership

Jul 2026

Amazon behavioral round for a senior data scientist position. Two questions, both focused on ownership and results. Nothing too surprising but the follow-up pressure on tradeoffs was real.

Walk me through a challenging project you led or had a major hand in. What was the business problem, why did it matter, what were the constraints, and what did you actually deliver?
Looking back at that project, what would you do differently and why?

“The part that tripped me up wasn't describing the project, it was the tradeoffs.”

View Post

Amazon·Data Scientist·Hiring Manager Screen

Jul 2026

Quick hiring manager screen for a Data Scientist role at Amazon, basically just a coding warmup to make sure you can actually write Python before moving forward.

Write a Python function that takes a list of daily energy consumption values and returns the 7-day rolling average, including edge case handling for fewer than 7 data points.

“Went with a sliding window approach, which felt right.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jul 2026

Amazon SWE coding round, one graph traversal problem. Pretty standard DFS stuff but the setup tripped me up a bit.

Given a directed acyclic graph with n nodes and a list of edges, write a program to find all possible paths starting from a given source node.

“Went with DFS and backtracking.”

View Post

Amazon·Software Engineer·Onsite - Multi Round

Jul 2026

Four-round virtual loop for an SDE role at Amazon, covering behavioral, bar raiser, hiring manager deep dive, and a final technical round. The coding questions ranged from graph reachability to a multi-attribute heap scheduling problem, and the recruiter communication was genuinely awful the whole way through.

Tell me about a time you delivered an important project under a tight deadline. What trade-offs did you make?
Describe a situation where you exceeded expectations on a project or task.
Given a list of task dependency pairs, write a function to find all tasks that would be impacted if a specific task is delayed. Follow-up: find the longest chain of cascading delays.
Walk me through a time you had a conflict or disagreement with a teammate or stakeholder. What happened and what would you change?
Deep dive into a technical project you've worked on, specifically a retrieval-augmented generation pipeline. How did you design it, what problems did you run into, and how did you solve them?
Implement an in-place array shuffle algorithm.
Tell me about a time you took ownership of a cross-team problem that wasn't clearly yours to solve.
Design a scheduling system using a priority queue where items must be ordered by three attributes simultaneously. Follow-up: how do you prevent lower-priority items from waiting indefinitely as higher-priority items keep arriving?

“Went in with a story ready, which helped.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jul 2026

Amazon SWE interview with two algorithmic problems, both on the harder side. The interval coverage one was conceptually tricky and the GCD subarray problem had a neat twist with the k-modification constraint. Came away feeling like I need to sharpen my greedy intuition.

You're given n closed intervals on a number line. What is the minimum number of intervals you need to remove so that, among what remains, at least one interval fully contains all the others? Describe your algorithm with time and space complexity.
Given an integer array and a value k representing the max number of elements you can change inside a chosen subarray, find the shortest contiguous subarray where you can modify at most k elements to make the entire subarray's GCD greater than 1. For example, nums = [2, 2, 4, 9, 6] with k = 1 should return 1.

“My first instinct was to sort by left endpoint and then brute force something, which was wrong.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jul 2026

Amazon SWE interview with a language choice question that sounds easy but actually has a lot of layers to it. Walked away feeling like I talked too much without saying enough.

If you could pick any language for a front-end coding interview, would you choose JavaScript? Walk through the trade-offs against TypeScript or Python in terms of expressiveness, runtime quirks like types and hoisting, closures, standard library, and how readable your code looks to the interviewer.

“I said JavaScript without hesitating, which felt right, but then I kind of fumbled the justification.”

View Post