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 2629 results
- AmazonMediumSoftware EngineerDetect and Break a Cycle in a Singly Linked List
Tests detection and resolution of cycles in singly linked lists using two-pointer techniques with constant auxiliary space.
Coding & AlgorithmsTechnical Screenlinked-listtwo-pointersfloyds-algorithm - 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 EngineerDetect cycles in lists and graphs
This question evaluates understanding of cycle detection in linked lists and directed graphs, assessing competencies in pointer manipulation, graph traversal strategies, and reasoning about algorithmic time and space complexity within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerDetect words formed by multiple dictionary parts
This question evaluates proficiency in string processing, selection and use of appropriate data structures and algorithms (hashing, tries), dynamic programming and memoization, and complexity analysis for large inputs and edge-case handling within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerDetermine Rounds for Star Substring Threshold
This question evaluates string-processing and algorithmic problem-solving skills, including handling incremental updates, counting substrings impacted by character replacements, and performance-aware simulation.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerDetermine Whether All Courses Can Be Completed
This problem tests your ability to model dependencies using a directed graph and detect cycles to determine if a set of tasks can be completed.
Coding & AlgorithmsTechnical ScreenGraphTopological SortDFS - AmazonEasySoftware EngineerDetermine Whether One Person Can Attend Every Meeting
This problem tests your ability to handle interval sorting and linear-time overlap detection to ensure no two meetings conflict.
Coding & AlgorithmsTechnical ScreenSortingIntervalsGreedy - AmazonMediumSoftware EngineerDetermine Whether Package Weights Can Be Safely Arranged
Tests array manipulation, counting techniques, and greedy or constraint-satisfaction logic to determine if an array can be permuted so no two adjacent elements sum to ten or more.
Coding & AlgorithmsTechnical ScreenGreedyCountingArray - AmazonMediumSoftware EngineerDetermine Whether a Binary Tree Is a Valid BST
Determine whether an entire breadth-first encoded binary tree obeys the strict BST invariant. Use ancestor bounds rather than only parent-child checks, reject duplicates, handle numeric extremes, and discuss an iterative approach for deep trees.
Coding & AlgorithmsTechnical Screen - 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 - AmazonMediumSoftware EngineerDrone Circular Route — Minimum Total Travel Cost
This problem tests your ability to solve a variation of the Traveling Salesman Problem using bitmask dynamic programming to optimize route costs in a small, weighted graph.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingBitmaskingGraph Theory - 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 - AmazonHardSoftware EngineerEvaluate IP Access Rules
This question evaluates knowledge of IPv4 addressing, CIDR subnet matching, and access-control rule resolution, assessing competency in bitwise address reasoning, prefix-length precedence, and rule tie-breaking.
Coding & AlgorithmsTechnical Screen - AmazonHardSoftware EngineerFewest Severity Inversions When Interleaving Two Patch Queues
Merge two severity-labeled patch queues into one install order that keeps each queue's internal order, and return the minimum number of severity inversions over every valid merge. Tests DP over two sequences and efficient counting with letters as priorities.
Coding & AlgorithmsOnline Assessmentdynamic-programmingstringsinversions - AmazonHardSoftware EngineerFind Longest Activatable Server Streak
This problem tests your ability to use the sliding window technique to find the longest contiguous subarray that satisfies a specific count-based constraint.
Coding & AlgorithmsOnline AssessmentSliding WindowTwo PointersArray - AmazonHardSoftware EngineerFind Two-Word Compound Words
This problem tests string manipulation, hash set lookups, and the ability to efficiently identify compound words formed by the concatenation of exactly two distinct words from a provided collection.
Coding & AlgorithmsTechnical ScreenStringsHash SetAlgorithms - AmazonHardSoftware EngineerFind a Maximum-Sum Window in a Sparse Array
This problem tests the ability to optimize sliding window calculations for extremely large arrays by leveraging compressed data structures (run-length encoding) rather than materializing the full array.
Coding & AlgorithmsOnline AssessmentSliding WindowArraysOptimization - 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 a valid dependency order
This question evaluates understanding of directed graphs, dependency resolution and cycle detection, and the ability to reason about valid ordering constraints within a graph representation.
Coding & AlgorithmsOnline Assessment - AmazonEasySoftware EngineerFind all cells reachable by downhill flow
This question evaluates graph traversal and reachability reasoning on a 2D elevation grid, testing algorithmic problem-solving, complexity analysis, and handling of monotonic flow constraints.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerFind concatenated words in list
This question evaluates proficiency in string manipulation, efficient lookup structures (e.g., hashing/trie) and dynamic programming or recursion for word segmentation, testing algorithmic efficiency and data-structure selection within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerFind first unique character
Find first unique character 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 & AlgorithmsTechnical Screen - 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 longest segment with dominant ends
This question evaluates algorithmic problem-solving with arrays and complexity-aware design, testing skills in efficient subarray identification, boundary reasoning, and performance analysis within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerFind longest segment with endpoints > interior
This question evaluates algorithmic design and array-processing skills, specifically reasoning about subarray endpoint vs interior relationships, range comparisons, and designing solutions with subquadratic time and space complexity.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerFind max equal-frequency block count for each prefix
This problem tests your ability to efficiently manage character frequency tracking while processing string prefixes, using hash maps or frequency arrays to validate partitioning conditions.
Coding & AlgorithmsTechnical ScreenStringsDynamic ProgrammingHash Map - AmazonMediumSoftware EngineerFind minimum days to deliver all orders
This question evaluates algorithm design and combinatorial optimization skills, focusing on scheduling and load-balancing under per-center capacity constraints and frequency-based counting.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerFind minimum time for irrecoverable password
This question evaluates string-processing skills, combinatorial counting of substrings, simulation of time-based state changes, and algorithmic complexity analysis.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerFind minimum total range-increment to sort
This problem tests your ability to determine the minimum total operations required to make an array non-decreasing by incrementing contiguous subarrays, requiring insights into difference arrays or monotonic properties.
Coding & AlgorithmsOnline AssessmentGreedyArraysDifference Array - 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
Amazon