practice a little every day, paws crossed ♡
Software Engineer Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 121–150 of 2336 results
- AmazonMediumSoftware EngineerDesign globally consistent metadata service
This question tests the ability to design a globally distributed metadata service that requires strict consistency for frequent read/write operations across multiple geographic regions.
System DesignOnsiteDistributed SystemsConsistencyScalability - AmazonMediumSoftware EngineerDesign multi-tenant ingestion and processing platform
This question tests the ability to design a multi-tenant data platform that ensures resource fairness, performance isolation, and cost attribution at scale.
System DesignOnsiteMulti-tenancyScalabilityDistributed Systems - AmazonMediumSoftware EngineerDesign object model for an elevator system
This question evaluates object-oriented design and system-architecture skills for modeling a multi-elevator control system, including class responsibilities, interactions, request flow, and scheduling policies.
Software Engineering FundamentalsOnsite - AmazonHardSoftware EngineerDesign ride-hailing pricing with fairness and pooling
This question evaluates system design and algorithmic skills related to real-time distributed pricing, API and data-flow architecture, carpooling logic, fairness constraints, and experimentation support.
System DesignOnsite - AmazonMediumSoftware EngineerDesign rolling-window top-K click tracker
Design rolling-window top-K click tracker evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerDetect cycle in a directed graph
This question evaluates mastery of graph algorithms and graph theory concepts—specifically directed cycle detection—and assesses the ability to reason about algorithmic correctness and to analyze time and space complexity for competing approaches.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerDetermine string segmentability with dictionary
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Determine string segmentability with dictionary states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - AmazonEasySoftware EngineerDiscuss AI Use, Deadlines, Ambiguity, and Feedback
Prepare evidence-based behavioral stories about generative AI use, technical complexity, deadlines, ambiguity, ownership, critical feedback, and rapid learning. Emphasize personal decisions, verification, stakeholder communication, honest trade-offs, measurable outcomes, and lessons from imperfect results.
Behavioral & LeadershipOnsite - AmazonMediumSoftware EngineerEscalation Stack That Resolves the Most-Reported Issue First
Design a support-escalation structure where resolving an issue always clears whichever one currently has the most open reports, breaking ties by the most recently reported occurrence. Tests combining frequency and recency so both operations run in O(1).
Coding & AlgorithmsOnsitestackhash-mapdesign - AmazonMediumSoftware EngineerEvaluating Generative AI Use and Accuracy
Tests a candidate's ability to assess when Generative AI is the right solution, choose appropriate architecture patterns (such as RAG or fine-tuning), and rigorously measure and improve model output accuracy in production.
Machine LearningOnsiteGenerative AIRAGML Evaluation - AmazonMediumSoftware EngineerExplain Decoder-Only LLM Architecture and How vLLM Serves It Efficiently
A two-part conversational question for AI infrastructure roles: explain how a decoder-only transformer turns a prompt into next-token probabilities, then explain how vLLM serves such models efficiently. It tests transformer internals, KV cache sizing, prefill versus decode bottlenecks, paged KV memory and continuous batching.
Machine LearningOnsite - AmazonMediumSoftware EngineerExplain What You Want in Your Next Role
Explain next-role motivation by connecting personal goals and evidence-backed strengths to verified team needs, while acknowledging open questions and tradeoffs.
Behavioral & LeadershipOnsite - AmazonMediumSoftware EngineerExplain Why You Are Considering a Job Change
This question assesses your ability to articulate a professional narrative that balances growth aspirations with current career satisfaction, ensuring that the motivation for leaving is proactive rather than reactive.
Behavioral & LeadershipOnsiteBehavioralCareer GrowthCommunication - AmazonMediumSoftware EngineerExplain a GenAI Use Case and Learn from a Failure
Tests your ability to critically analyze a production Generative AI architecture, dissect a technical failure or performance degradation, and demonstrate rigorous root-cause analysis alongside validated engineering remediations.
Software Engineering FundamentalsOnsiteGenerative AISystem DesignRCA - AmazonMediumSoftware EngineerExplain how you use AI tools to learn and code, and defend a past AI project
A hiring-manager discussion for an entry-level software engineer about working with AI tools. It asks how the candidate uses AI to learn and to code, then probes a past AI project: whether AI was truly needed, how its output is verified, and how it would scale in a very large organization.
Behavioral & LeadershipOnsite - AmazonHardSoftware EngineerFind a Valid Course Order
This problem tests your ability to detect cycles in a directed graph and perform a topological sort to resolve dependencies.
Coding & AlgorithmsOnsiteGraphsTopological SortKahn's Algorithm - AmazonMediumSoftware EngineerFind longest common contiguous subarray
This question evaluates a candidate's proficiency in array and substring algorithm design, including concepts such as dynamic programming, hashing, and efficient search techniques.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerFind returning users from access logs
This question evaluates skills in time-series data processing, timestamp parsing and time-zone normalization, scalable stream or batch handling for logs that exceed memory, algorithmic complexity analysis, and test-case design for edge conditions such as midnight boundaries and duplicate events.
Coding & AlgorithmsOnsite - AmazonHardSoftware EngineerFind the Closest Version by Date
This problem tests your ability to efficiently search through chronologically ordered records and handle binary search logic with custom comparison rules.
Coding & AlgorithmsOnsiteBinary SearchArraysAlgorithms - AmazonMediumSoftware EngineerFind the Kth Smallest Value in a Binary Search Tree
Deserialize a level-order serialized binary search tree and find its kth smallest element using an efficient in-order traversal.
Coding & AlgorithmsOnsitebinary-search-treetree-traversalstack - AmazonMediumSoftware EngineerFind the Minimum Processing Rate to Meet a Deadline
This problem tests the ability to determine a minimum threshold using binary search on the answer space, combined with modular arithmetic and ceiling division.
Coding & AlgorithmsOnsiteBinary SearchMathOptimization - AmazonHardSoftware EngineerFind the Most Common Visit Pattern
This problem tests your ability to process chronological event data to identify the most frequent 3-step sequence, requiring efficient data structures to handle large volumes of user logs.
Coding & AlgorithmsOnsiteHash MapSortingSliding Window - AmazonMediumSoftware EngineerFind the Most Frequent Request IDs
Implement an algorithm to identify the top k most frequent request IDs from a stream of log events, breaking frequency ties by smaller ID values and handling cases where k exceeds the number of unique IDs.
Coding & AlgorithmsOnsitehash-tableheapsorting - AmazonMediumSoftware EngineerFinding the Root Cause of an Intermittent Failure When the Obvious Metrics Look Healthy
A behavioral debugging question: describe a system that failed intermittently while its obvious metrics looked healthy, how you found the root cause, and how long it took. It tests whether you can explain why the dashboards stayed green and show a systematic, evidence-driven narrowing process.
Behavioral & LeadershipOnsite - AmazonMediumSoftware EngineerGenAI Literacy Questions: Daily AI Use, Handling Bad AI Output, and RAG Projects
Behavioral questions on generative AI literacy reported from hiring manager and Bar Raiser rounds: how you use AI tools day to day, a time you caught bad AI output, and a walkthrough of a retrieval-augmented generation project. It tests verification habits, judgment about data boundaries and RAG fundamentals.
Behavioral & LeadershipOnsite - AmazonMediumSoftware EngineerGeneralize Dictionary Merging
Explain an approach to merging two dictionaries and generalizing it efficiently to k dictionaries, explicitly identifying the collision semantics that must be clarified.
Software Engineering FundamentalsOnsite - AmazonMediumSoftware EngineerHigh Availability and Failover for a Primary-Replica Database
This problem tests your ability to design a resilient database architecture that minimizes downtime and data loss during node failures.
System DesignOnsiteDatabaseHigh AvailabilityReplication - AmazonMediumSoftware EngineerImplement Cache and Rotate Matrix
This two-part question evaluates competency in data structure design and in-place array manipulation, specifically the ability to implement an LRU cache with O(1)-average operations (including recency management, updates, and evictions) and to rotate an n x n matrix 90 degrees clockwise in place without extra space.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerImplement LRU cache with O(1) ops
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement LRU cache with O(1) ops states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerImplement a Min-Priority Queue Without a Library Heap
Tests implementation of a binary min-heap from scratch, including array-based representation, sift-up, and sift-down operations, without relying on built-in priority queue libraries.
Coding & AlgorithmsOnsiteHeapData StructuresDesign
Amazon