Amazon Data Manipulation (SQL/Python) Interview Questions
Practice 629 real Amazon interview questions for 2026. Covers all top categories — Coding & Algorithms, Behavioral & Leadership, Machine Learning, Data Manipulation (SQL/Python), and System Design — across Software Engineer, Data Scientist, Machine Learning Engineer, Product Manager, and Business Intelligence Engineer roles. Real Amazon interview questions from actual interviews with detailed solutions; use this collection for interview preparation that emphasizes shipping at scale, measurable impact, and the company’s Leadership Principles. Expect coding-heavy assessments for Software Engineer candidates: frequent tree and dynamic-programming problems, two-array optimization patterns, nested object/path lookups, and system-design prompts that mirror product flows (online Minesweeper, pizza-ordering, credit-card and shipping/cost systems), plus leadership and collaboration behavioral prompts. Data Scientist rounds concentrate on experimentation and metrics (A/B design, hand p-values, D7 retention SQL), RAG/recommender evaluation, and product-impact analyses. ML Engineer questions focus on production model design, LLM/agent concepts, reliability (cold start, training stability, online vs offline gaps), and large-scale detection pipelines. PM interviews stress customer-obsessed stories, ambiguity, Alexa product launches, and domain-specific data pipelines. Prepare with timed coding practice, end-to-end experiment writeups, STAR stories framed to Leadership Principles, and mock system-design sessions.

"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"

"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"

"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."

"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."

"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."

"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."

"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."

"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."

"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."

"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."

"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."

"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."

"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."

"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Demonstrate Amazon leadership principles
Demonstrate Amazon leadership principles Behavioral & Leadership Interview (Software Engineer — Onsite) Provide STAR-structured answers (Situation, Ta...
Optimize XGBoost for Predicting Marketing Outcomes
Optimize XGBoost for Predicting Marketing Outcomes Gradient-Boosted Trees for Marketing Outcome Prediction Context You’re building a model to predict ...
Explain Decision-Tree Training and Clustering Algorithms
Explain Decision-Tree Training and Clustering Algorithms Decision Trees and Clustering: Training Mechanics and Core Principles Context Technical/phone...
Choose Models for Imbalanced Data and Time-Series Forecasting
Choose Models for Imbalanced Data and Time-Series Forecasting Scenario You must choose and tune models for (a) forecasting marketplace demand with sea...
Explain Propensity Score Matching and Assess Covariate Balance
Explain Propensity Score Matching and Assess Covariate Balance Propensity Score Matching (PSM) Context You have observational data with a binary treat...
Explain K-Fold Cross-Validation and Its Trade-Offs
Explain K-Fold Cross-Validation and Its Trade-Offs Technical Phone Screen: Cross-Validation Task You are interviewing for a Data Scientist role. Expla...
Facilitate Effective Collaboration in Tech Data-Science Teams
Facilitate Effective Collaboration in Tech Data-Science Teams Behavioral & Leadership (Data Scientist Onsite) Scenario You are interviewing for a Data...
Diagnose Business Decline Using Key Data Metrics
Diagnose Business Decline Using Key Data Metrics Diagnose a Sudden Business Downturn Using Data Context You are the data scientist supporting a large ...
Solve Algorithmic Challenges in Online Coding Assessments
Scenario Online assessment requiring implementation of common algorithmic problems. Question Given an array of integers and a target, return indices o...
Decide reachability with buses and limited walking
You are given: ( 1) a start point (xs, ys), ( 2) an end point (xe, ye), ( 3) an integer K, and ( 4) an undirected graph of bus stations where each nod...
Find substring from dictionary concatenation
Given a string s and a dictionary of words dict, determine whether s contains a substring that is exactly a concatenation of one or more words from di...
Describe diving deep into a problem
Describe diving deep into a problem Behavioral: Dive Deep to Resolve a Complex System Issue Prompt Describe a situation where you had to dive deep int...
Respond to negative feedback and exceed requirements
Respond to negative feedback and exceed requirements Behavioral Question: Negative Feedback and Going Beyond Requirements Context: Software Engineer —...
Explain ML statistics and model design concepts
Explain ML statistics and model design concepts Technical Phone Screen: Theory + System Design Probability and Statistics 1. Define a moment generatin...
Find longest common contiguous subarray
Given two integer arrays A and B, find the length of the longest contiguous subarray that appears in both arrays. If multiple exist, return any one pa...
Design a fixed-capacity circular queue
Design a fixed-capacity circular queue that supports enqueue(x), dequeue(), front(), rear(), isEmpty(), and isFull() operations in O( 1) time. Impleme...
Compute grid shortest path with obstacles
You are given an m x n grid of integers where cells with value -1 represent obstacles and all other cells are traversable. Starting at (0, 0) and targ...
Implement autocomplete with top-K suggestions
Implement an autocomplete component that, given a history of query strings with frequencies, returns the top K suggestions for an input prefix in real...
Design in-memory threshold switcher
Design an In-Memory Memory-Pressure Switcher Context You are designing an in-memory component ("Switcher") that gates expensive work (e.g., request ad...
Compute tree diameter
Given a (potentially large) binary tree, compute its diameter (the number of edges on the longest path between any two nodes). Implement an O(n) solut...