Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 1152. Analyze User Website Visit Pattern | Medium | ||
| 253. Meeting Rooms II | Medium | ||
| 146. LRU Cache | Medium | ||
| 207. Course Schedule | Medium | ||
| 348. Design Tic-Tac-Toe | Medium | ||
| 904. Fruit Into Baskets | Medium | ||
| 121. Best Time to Buy and Sell Stock | Easy | ||
| 6. Zigzag Conversion | Medium | ||
| 1. Two Sum | Easy | ||
| 1166. Design File System | Medium | ||
| 🔒 | 226. Invert Binary Tree | Depth-First SearchBreadth-First Search | Easy |
| 🔒 | 1475. Final Prices With a Special Discount in a Shop | Misc. | Easy |
| 🔒 | 124. Binary Tree Maximum Path Sum | Depth-First SearchDynamic Programming | Hard |
| 🔒 | 450. Delete Node in a BST | Basic DSA | Medium |
| 🔒 | 3074. Apple Redistribution into Boxes | Misc.Basic DSA | Easy |
| 🔒 | 1650. Lowest Common Ancestor of a Binary Tree III | Two Pointers | Medium |
| 🔒 | 10. Regular Expression Matching | BacktrackingDynamic Programming | Hard |
| 🔒 | 723. Candy Crush | Two PointersSimulation | Medium |
| 🔒 | 465. Optimal Account Balancing | Dynamic ProgrammingBacktracking | Hard |
| 🔒 | 14. Longest Common Prefix | Adv. Data Structure | Easy |
| 🔒 | 108. Convert Sorted Array to Binary Search Tree | Misc. | Easy |
| 🔒 | 616. Add Bold Tag in String | Adv. Data Structure | Medium |
| 🔒 | 2553. Separate the Digits in an Array | Simulation | Easy |
| 🔒 | 2598. Smallest Missing Non-negative Integer After Operations | Misc. | Medium |
| 🔒 | 286. Walls and Gates | Breadth-First Search | Medium |
| 🔒 | 2731. Movement of Robots | Two PointersBasic DSA | Medium |
| 🔒 | 101. Symmetric Tree | Depth-First SearchBreadth-First Search | Easy |
| 🔒 | 40. Combination Sum II | Backtracking | Medium |
| 🔒 | 370. Range Addition | Two Pointers | Medium |
| 🔒 | 347. Top K Frequent Elements | Misc.Basic DSA | Medium |
| 🔒 | 76. Minimum Window Substring | Two Pointers | Hard |
| 🔒 | 147. Insertion Sort List | Basic DSA | Medium |
| 🔒 | 1229. Meeting Scheduler | Two PointersBasic DSA | Medium |
| 🔒 | 20. Valid Parentheses | Basic DSA | Easy |
| 🔒 | 2946. Matrix Similarity After Cyclic Shifts | Simulation | Easy |
| 🔒 | 1429. First Unique Number | Basic DSA | Medium |
| 🔒 | 62. Unique Paths | Dynamic Programming | Medium |
| 🔒 | 75. Sort Colors | Two PointersBasic DSA | Medium |
| 🔒 | 105. Construct Binary Tree from Preorder and Inorder Traversal | Misc. | Medium |
| 🔒 | 2299. Strong Password Checker II | Basic DSA | Easy |
| 🔒 | 316. Remove Duplicate Letters | Misc. | Medium |
| 🔒 | 2764. Is Array a Preorder of Some Binary Tree | Depth-First Search | Medium |
| 🔒 | 1980. Find Unique Binary String | Backtracking | Medium |
| 🔒 | 735. Asteroid Collision | Simulation | Medium |
| 🔒 | 527. Word Abbreviation | Misc.Adv. Data StructureBasic DSA | Hard |
| 🔒 | 1603. Design Parking System | Basic DSASimulation | Easy |
| 🔒 | 1312. Minimum Insertion Steps to Make a String Palindrome | Dynamic Programming | Hard |
| 🔒 | 759. Employee Free Time | Basic DSA | Hard |
| 🔒 | 378. Kth Smallest Element in a Sorted Matrix | Binary SearchBasic DSA | Medium |
| 🔒 | 3088. Make String Anti-palindrome | Misc.Basic DSA | Hard |
| 🔒 | 120. Triangle | Dynamic Programming | Medium |
| 🔒 | 152. Maximum Product Subarray | Dynamic Programming | Medium |
| 🔒 | 243. Shortest Word Distance | Basic DSA | Easy |
| 🔒 | 2124. Check if All A's Appears Before All B's | Basic DSA | Easy |
| 🔒 | 543. Diameter of Binary Tree | Depth-First Search | Easy |
| 🔒 | 769. Max Chunks To Make Sorted | Misc.Basic DSA | Medium |
| 🔒 | 2115. Find All Possible Recipes from Given Supplies | Graph | Medium |
| 🔒 | 159. Longest Substring with At Most Two Distinct Characters | Two Pointers | Medium |
| 🔒 | 276. Paint Fence | Dynamic Programming | Medium |
| 🔒 | 32. Longest Valid Parentheses | Dynamic Programming | Hard |
| 🔒 | 1029. Two City Scheduling | Misc.Basic DSA | Medium |
| 🔒 | 344. Reverse String | Two Pointers | Easy |
| 🔒 | 1644. Lowest Common Ancestor of a Binary Tree II | Depth-First Search | Medium |
| 🔒 | 1840. Maximum Building Height | Basic DSA | Hard |
| 🔒 | 236. Lowest Common Ancestor of a Binary Tree | Depth-First Search | Medium |
| 🔒 | 340. Longest Substring with At Most K Distinct Characters | Two Pointers | Medium |
| 🔒 | 941. Valid Mountain Array | Basic DSA | Easy |
| 🔒 | 53. Maximum Subarray | Misc.Dynamic Programming | Medium |
| 🔒 | 706. Design HashMap | Basic DSAAdv. Data Structure | Easy |
| 🔒 | 170. Two Sum III - Data structure design | Two Pointers | Easy |
| 🔒 | 2092. Find All People With Secret | Depth-First SearchBreadth-First SearchAdv. Data StructureGraphBasic DSA | Hard |
| 🔒 | 44. Wildcard Matching | Misc.BacktrackingDynamic Programming | Hard |
| 🔒 | 545. Boundary of Binary Tree | Depth-First Search | Medium |
| 🔒 | 867. Transpose Matrix | Simulation | Easy |
| 🔒 | 3644. Maximum K to Sort a Permutation | Basic DSA | Medium |
| 🔒 | 1091. Shortest Path in Binary Matrix | Breadth-First Search | Medium |
| 🔒 | 849. Maximize Distance to Closest Person | Basic DSA | Medium |
| 🔒 | 412. Fizz Buzz | Simulation | Easy |
| 🔒 | 72. Edit Distance | Dynamic Programming | Medium |
| 🔒 | 346. Moving Average from Data Stream | Basic DSA | Easy |
| 🔒 | 2435. Paths in Matrix Whose Sum Is Divisible by K | Dynamic Programming | Hard |
| 🔒 | 968. Binary Tree Cameras | Depth-First SearchDynamic Programming | Hard |
| 🔒 | 1437. Check If All 1's Are at Least Length K Places Away | Basic DSA | Easy |
| 🔒 | 164. Maximum Gap | Basic DSA | Medium |
| 🔒 | 287. Find the Duplicate Number | Two PointersBinary Search | Medium |
| 🔒 | 2281. Sum of Total Strength of Wizards | Two PointersMisc. | Hard |
| 🔒 | 110. Balanced Binary Tree | Depth-First Search | Easy |
| 🔒 | 1167. Minimum Cost to Connect Sticks | Misc. | Medium |
| 🔒 | 240. Search a 2D Matrix II | Binary SearchMisc. | Medium |
| 🔒 | 337. House Robber III | Depth-First SearchDynamic Programming | Medium |
| 🔒 | 2257. Count Unguarded Cells in the Grid | Simulation | Medium |
| 🔒 | 655. Print Binary Tree | Depth-First SearchBreadth-First Search | Medium |
| 🔒 | 5. Longest Palindromic Substring | Two PointersDynamic Programming | Medium |
| 🔒 | 55. Jump Game | Misc.Dynamic Programming | Medium |
| 🔒 | 200. Number of Islands | Depth-First SearchBreadth-First SearchAdv. Data Structure | Medium |
| 🔒 | 314. Binary Tree Vertical Order Traversal | Depth-First SearchBreadth-First SearchBasic DSA | Medium |
| 🔒 | 15. 3Sum | Two PointersBasic DSA | Medium |
| 🔒 | 1263. Minimum Moves to Move a Box to Their Target Location | Breadth-First Search | Hard |
| 🔒 | 261. Graph Valid Tree | Depth-First SearchBreadth-First SearchAdv. Data StructureGraph | Medium |
| 🔒 | 487. Max Consecutive Ones II | Dynamic ProgrammingTwo Pointers | Medium |
| 🔒 | 305. Number of Islands II | Adv. Data Structure | Hard |
| 🔒 | 2214. Minimum Health to Beat Game | Misc. | Medium |
| 🔒 | 3035. Maximum Palindromes After Operations | Misc.Basic DSA | Medium |
| 🔒 | 1139. Largest 1-Bordered Square | Dynamic Programming | Medium |
| 🔒 | 888. Fair Candy Swap | Binary SearchBasic DSA | Easy |
| 🔒 | 3610. Minimum Number of Primes to Sum to Target | Basic DSA | Medium |
| 🔒 | 1002. Find Common Characters | Basic DSA | Easy |
| 🔒 | 767. Reorganize String | Misc.Basic DSA | Medium |
| 🔒 | 424. Longest Repeating Character Replacement | Two Pointers | Medium |
| 🔒 | 142. Linked List Cycle II | Basic DSATwo Pointers | Medium |
| 🔒 | 93. Restore IP Addresses | Backtracking | Medium |
| 🔒 | 498. Diagonal Traverse | Simulation | Medium |
| 🔒 | 17. Letter Combinations of a Phone Number | Backtracking | Medium |
| 🔒 | 277. Find the Celebrity | GraphTwo Pointers | Medium |
| 🔒 | 2436. Minimum Split Into Subarrays With GCD Greater Than One | Misc.Dynamic Programming | Medium |
| 🔒 | 2348. Number of Zero-Filled Subarrays | Basic DSA | Medium |
| 🔒 | 560. Subarray Sum Equals K | Two Pointers | Medium |
| 🔒 | 359. Logger Rate Limiter | Basic DSA | Easy |
| 🔒 | 851. Loud and Rich | Depth-First SearchGraph | Medium |
| 🔒 | 134. Gas Station | Misc. | Medium |
| 🔒 | 727. Minimum Window Subsequence | Dynamic ProgrammingTwo Pointers | Hard |
| 🔒 | 49. Group Anagrams | Basic DSA | Medium |
| 🔒 | Minimum Swaps to Group All 1's Together | two_pointerssliding_window | Medium |
| 🔒 | 174. Dungeon Game | Dynamic Programming | Hard |
| 🔒 | 137. Single Number II | Basic DSA | Medium |
| 🔒 | 2268. Minimum Number of Keypresses | Misc.Basic DSA | Medium |
| 🔒 | 206. Reverse Linked List | BacktrackingBasic DSA | Easy |
| 🔒 | 324. Wiggle Sort II | Misc.Basic DSA | Medium |
| 🔒 | 2428. Maximum Sum of an Hourglass | Two Pointers | Medium |
| 🔒 | 1790. Check if One String Swap Can Make Strings Equal | Basic DSA | Easy |
| 🔒 | 1337. The K Weakest Rows in a Matrix | Binary SearchBasic DSA | Easy |
| 🔒 | 354. Russian Doll Envelopes | Binary SearchDynamic ProgrammingBasic DSA | Hard |
| 🔒 | 127. Word Ladder | Breadth-First Search | Hard |
| 🔒 | 2781. Length of the Longest Valid Substring | Two Pointers | Hard |
| 🔒 | 2340. Minimum Adjacent Swaps to Make a Valid Array | Misc. | Medium |
| 🔒 | 2055. Plates Between Candles | Binary SearchTwo Pointers | Medium |
| 🔒 | 2870. Minimum Number of Operations to Make Array Empty | Misc.Basic DSA | Medium |
| 🔒 | 472. Concatenated Words | Depth-First SearchAdv. Data StructureDynamic ProgrammingBasic DSA | Hard |
| 🔒 | 42. Trapping Rain Water | Two PointersDynamic ProgrammingMisc. | Hard |
| 🔒 | 950. Reveal Cards In Increasing Order | Basic DSASimulation | Medium |
| 🔒 | 1478. Allocate Mailboxes | Dynamic ProgrammingBasic DSA | Hard |
| 🔒 | 273. Integer to English Words | Backtracking | Hard |
| 🔒 | 1531. String Compression II | Dynamic Programming | Hard |
| 🔒 | 1457. Pseudo-Palindromic Paths in a Binary Tree | Depth-First SearchBreadth-First Search | Medium |
| 🔒 | 140. Word Break II | Adv. Data StructureBacktrackingDynamic Programming | Hard |
| 🔒 | 2667. Create Hello World Function | Basic DSA | Easy |
| 🔒 | 791. Custom Sort String | Basic DSA | Medium |
| 🔒 | 2355. Maximum Number of Books You Can Take | Dynamic ProgrammingMisc. | Hard |
| 🔒 | 2256. Minimum Average Difference | Two Pointers | Medium |
| 🔒 | 88. Merge Sorted Array | Two PointersBasic DSA | Easy |
| 🔒 | 1496. Path Crossing | Basic DSA | Easy |
| 🔒 | 3134. Find the Median of the Uniqueness Array | Binary SearchTwo Pointers | Hard |
| 🔒 | 23. Merge k Sorted Lists | Basic DSAMisc. | Hard |
| 🔒 | 210. Course Schedule II | Depth-First SearchBreadth-First SearchGraph | Medium |
| 🔒 | 1353. Maximum Number of Events That Can Be Attended | Misc.Basic DSA | Medium |
| 🔒 | 2288. Apply Discount to Prices | Basic DSA | Medium |
| 🔒 | 875. Koko Eating Bananas | Binary Search | Medium |
| 🔒 | 1063. Number of Valid Subarrays | Misc. | Hard |
| 🔒 | 1882. Process Tasks Using Servers | Basic DSA | Medium |
| 🔒 | 56. Merge Intervals | Basic DSA | Medium |
| 🔒 | 460. LFU Cache | Basic DSA | Hard |
| 🔒 | 3075. Maximize Happiness of Selected Children | Misc.Basic DSA | Medium |
| 🔒 | 239. Sliding Window Maximum | Two PointersMisc. | Hard |
| 🔒 | 935. Knight Dialer | Dynamic Programming | Medium |
| 🔒 | 1485. Clone Binary Tree With Random Pointer | Depth-First SearchBreadth-First Search | Medium |
| 🔒 | 295. Find Median from Data Stream | Two PointersBasic DSA | Hard |
| 🔒 | 1239. Maximum Length of a Concatenated String with Unique Characters | Backtracking | Medium |
| 🔒 | 587. Erect the Fence | Basic DSA | Hard |
| 🔒 | 869. Reordered Power of 2 | Basic DSA | Medium |
| 🔒 | 4. Median of Two Sorted Arrays | Binary SearchMisc. | Hard |
| 🔒 | 3. Longest Substring Without Repeating Characters | Two Pointers | Medium |
| 🔒 | 205. Isomorphic Strings | Basic DSA | Easy |
Sign up for free to track your progress, then upgrade to Pro for all 172 questions with detailed solutions.
Sign Up FreeAmazon's interview process for software engineers begins with a meticulous resume screening. Candidates that stand out typically proceed to Online Assessments (OAs), which test coding and problem-solving skills. This step is crucial for moving forward in the selection process.
Following successful OAs, applicants usually face one or two phone screens before advancing to onsite interviews. The onsite consists of multiple rounds, focusing on coding, system design, and leadership principles. The difficulty across these stages is considered high, reflecting Amazon's commitment to hiring top talent.
At Amazon, the initial resume screening focuses on your technical skills and past experience relevant to the role. This process typically involves automated systems checking for key terms and projects.
Following resume evaluation, candidates may face Online Assessments (OAs). These typically consist of coding tests and work style assessments, designed to measure problem-solving capabilities and cultural fit.
Amazon employs one or two phone screens as part of its recruiting process for software engineers. These interviews focus on coding and problem-solving skills, with questions often emphasizing data structures, algorithms, and system design.
During the phone screen, a software development engineer or a hiring manager typically conducts the interview. Candidates may need to write code in real-time via an online editor, discuss their approach to solving problems, or review past projects and experiences.
Amazon’s onsite rounds typically consist of four to six interviews, focusing on assessing both technical and behavioral skills. These interviews may include coding challenges, system design problems, and a deep dive into the principles of leadership.
During the onsite interviews, candidates are often asked to code on a whiteboard, solve real-world problems through system design, and demonstrate Amazon’s 14 Leadership Principles through behavioral questions. The process aims to gauge a candidate's ability to solve complex problems and fit into the company culture.
After completing your interview rounds at Amazon, candidates typically undergo team matching and can negotiate their job offer. Some roles might also entail meetings with senior executives before final decisions are made.

When preparing for an Amazon software engineering interview, it’s crucial to focus on the fundamentals. The distribution does not deviate from typical coding interviews, with Basic DSA, Dynamic Programming and Two Pointers being dominant patterns in their coding interviews. While honing these areas, candidates should also be prepared for less frequent but challenging patterns like Backtracking, ensuring a well-rounded ability to tackle a variety of problems.
Amazon's behavioral interviews are structured around their 16 Leadership Principles (expanded from 14 in recent years). Expect 2-3 behavioral questions per interview round, with each interviewer assigned 1-3 specific principles to evaluate. Use the STAR method (Situation, Task, Action, Result) to structure your responses.
Definition: Leaders start with the customer and work backwards. They work vigorously to earn and keep customer trust.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders are owners. They think long-term and don't sacrifice long-term value for short-term results.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders expect and require innovation and invention from their teams and always find ways to simplify.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders are right a lot. They have strong judgment and good instincts. They seek diverse perspectives and work to disconfirm their beliefs.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders are never done learning and always seek to improve themselves. They are curious about new possibilities and act to explore them.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders raise the performance bar with every hire and promotion. They recognize exceptional talent and willingly move them throughout the organization.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders have relentlessly high standards. They continually raise the bar and drive their teams to deliver high-quality products, services, and processes.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Thinking small is a self-fulfilling prophecy. Leaders create and communicate a bold direction that inspires results.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Speed matters in business. Many decisions and actions are reversible and do not need extensive study.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Accomplish more with less. Constraints breed resourcefulness, self-sufficiency, and invention.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders listen attentively, speak candidly, and treat others respectfully. They are vocally self-critical, even when doing so is awkward or embarrassing.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders operate at all levels, stay connected to the details, audit frequently, and are skeptical when metrics and anecdotes differ.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders are obligated to respectfully challenge decisions when they disagree, even when doing so is uncomfortable. Leaders have conviction and are tenacious. They do not compromise for the sake of social cohesion.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders focus on the key inputs for their business and deliver them with the right quality and in a timely fashion. Despite setbacks, they rise to the occasion and never settle.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: Leaders work every day to create a safer, more productive, higher performing, more diverse, and more just work environment.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Definition: We started in a garage, but we're not there anymore. We are big, we impact the world, and we are far from perfect. We must be humble and thoughtful about even the secondary effects of our actions.
Common Interview Questions:
How to Answer:
Example Answer Framework:
Prepare 8-10 STAR Stories
Common Question Patterns
What Interviewers Look For
Technical Preparation
Mock Interviews
Research Amazon