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 211–240 of 2629 results
- AmazonHardSoftware EngineerMinimize Branch Merge Conflicts
This question evaluates understanding of combinatorial optimization, set operations, and order-dependent state management, requiring reasoning about how commit file modifications accumulate across branch merges.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerMinimize Circular Redistribution Cost
This problem tests your ability to handle circular array indexing and perform efficient redistributions using modulo arithmetic and prefix sum concepts.
Coding & AlgorithmsOnline AssessmentArraysModuloOptimization - AmazonMediumSoftware EngineerMinimize Global Replacements to Make Values Contiguous
Determine the minimum number of global value replacements needed so that every remaining value in an array forms a single contiguous block.
Coding & AlgorithmsOnline Assessmentintervalsgreedyhash-table - AmazonMediumSoftware EngineerMinimize Grid Inconvenience by Adding One Delivery Center
Add at most one delivery center to minimize the maximum Chebyshev distance from ordinary grid cells to their nearest center.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerMinimize Points Used Across Multiple Reward Programs
Minimize the number of indivisible reward points needed to meet or exceed a microdollar target across programs with different values and finite balances, returning failure when coverage is impossible.
Coding & AlgorithmsTechnical Screen - AmazonHardSoftware EngineerMinimize Replacements So Equal Product Values Are Contiguous
This problem tests your ability to optimize data transformations by identifying contiguous blocks of identical values, modeled as a shortest-path or dynamic programming problem on a compressed representation of the array.
Coding & AlgorithmsOnsiteGreedyDynamic ProgrammingData Structures - AmazonHardSoftware EngineerMinimize operations to reduce price difference
This question evaluates algorithm design and array-manipulation skills, focusing on reasoning about constrained transfers of value, invariants, and the minimization of operation counts under a fixed per-operation bound.
Coding & AlgorithmsOnline Assessment - AmazonHardSoftware EngineerMinimize time for two handlers
This problem tests your ability to use dynamic programming or greedy strategies with state tracking to minimize the total completion time of tasks assigned to two distinct handlers.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingOptimizationGreedy - AmazonMediumSoftware EngineerMinimum Bills and Coins to Make Change
This problem tests your ability to determine the optimal combination of coins and bills to achieve a specific target amount, while managing limited inventory and precision issues.
Coding & AlgorithmsTechnical ScreenGreedyDynamic ProgrammingArithmetic - AmazonMediumSoftware EngineerMinimum Drone Delivery Time on a Ring of Hubs
This problem tests your ability to calculate optimal traversal distances on a circular path, requiring the application of modular arithmetic and greedy logic to minimize movement between sequential points.
Coding & AlgorithmsTechnical ScreenAlgorithmsGreedyModular Arithmetic - AmazonMediumSoftware EngineerMinimum Moves for a Squirrel to Carry Every Nut to a Tree One at a Time
A squirrel on an obstacle-free grid must carry every nut to a tree, holding at most one nut at a time and moving one cell per step. The task asks for the minimum total number of moves over all delivery orders, testing reasoning about grid distances and how the order of deliveries affects the total.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerMinimum Path Length Through a Grid With One Allowed Cell Conversion
This problem tests your ability to adapt BFS to a state-space graph where an additional dimension represents the remaining capacity to modify the grid, requiring efficient state tracking to find the shortest path.
Coding & AlgorithmsOnline AssessmentBFSGraphShortest Path - AmazonHardSoftware EngineerMinimum Priority Conflicts When Interleaving Two Lowercase Strings
From an Amazon online assessment: merge two lowercase strings into one while keeping each string's internal order, where smaller letters have higher priority and every lower-priority letter placed before a higher-priority one counts as a conflict. Return the minimum possible number of conflicts over all valid merges.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerOptimize with a cache/hash map
Amazon software-engineer technical-screen coding follow-up: take an existing script (e.g. one that resolves file paths or parses license strings) and design a hash-map-backed in-memory cache to speed up repeated lookups. It tests choosing a cacheable computation, defining normalized keys and values, estimating hit rate, picking an eviction policy (LRU/LFU/TTL), invalidating on file mtime/content-hash changes, ensuring concurrency safety, and analyzing time and space complexity before and after caching.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerOrder Dependent Tasks and Identify Work to Rerun
Return any valid dependency order, detect cycles, and identify transitive reruns with a complete topological and reachability solution and order-independent validation.
Coding & AlgorithmsOnsite - AmazonEasySoftware EngineerPrint all odd numbers from an integer list
This question tests the ability to filter a collection based on a parity condition and handle potential overflow or negative integer scenarios.
Coding & AlgorithmsTechnical ScreenArraysBasic LogicFiltering - AmazonMediumSoftware EngineerRearrange Digits Without Adjacent Sums Above Nine
Rearrange a multiset of digits into the lexicographically smallest string such that every adjacent pair sums to at most nine, or return an empty string if impossible.
Coding & AlgorithmsTechnical Screengreedybacktrackingstring - AmazonMediumSoftware EngineerRearrange a String So Adjacent Characters Differ
Construct the lexicographically smallest rearrangement of a lowercase string with no equal adjacent characters, checking feasibility after each deterministic choice and returning empty when separation is impossible.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerReplace Delimited Tokens in a String
This problem tests string manipulation, hash map lookups, and edge-case handling when parsing nested or malformed delimiters within a template string.
Coding & AlgorithmsOnsiteStringsHash MapParsing - AmazonMediumSoftware EngineerResolve Package Dependencies with Cycle Detection
This problem tests your ability to perform a topological sort on a directed graph while identifying cyclic dependencies to ensure a safe build order.
Coding & AlgorithmsTechnical ScreenGraphDFSTopological Sort - AmazonHardSoftware EngineerRetrieve the Latest Timestamped Value for Each Key
Design a timestamped key-value store supporting out-of-order updates and point-in-time or latest queries in sub-linear time per operation.
Coding & AlgorithmsTechnical ScreenDesignBinary SearchHash Map - AmazonHardSoftware EngineerReturn all valid word-break sentences
This question evaluates skills in string processing, recursive search/backtracking, enumeration of all valid segmentations, and algorithmic complexity reasoning for generating multiple solutions.
Coding & AlgorithmsTechnical Screen - AmazonHardSoftware EngineerReturn the Maximum of Every Sliding Window
This problem tests your ability to maintain a sliding window maximum using an efficient data structure like a deque to achieve linear time complexity.
Coding & AlgorithmsHR ScreenArraysSliding WindowDeque - AmazonMediumSoftware EngineerReturn the Top K Most Frequent Elements
This problem tests the ability to efficiently count element frequencies and use bucket-based sorting to avoid O(N log N) time complexity.
Coding & AlgorithmsTechnical ScreenHash MapBucket SortFrequency - AmazonMediumSoftware EngineerSearch a Unix-Like File Tree with Composable Filters
Search an in-memory Unix-like file tree for physical files matching name and size filters combined by AND or OR. Support optional symlink traversal, broken links, cycles, duplicate reachability, stable identity, and lexicographically sorted canonical paths.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerSearch for a Value in a Matrix Sorted as One Continuous Sequence
Decide whether a target value appears in a matrix whose rows are sorted and whose every row starts above the previous row's last value. It tests exploiting that ordering to search in logarithmic time and handling single-row, repeated-value and boundary cases correctly.
Coding & AlgorithmsOther - AmazonMediumSoftware EngineerSearch target in unknown-length sorted array
This question evaluates algorithm design and implementation skills for search algorithms on array-like interfaces with unknown length, focusing on bounds discovery, handling out-of-bounds sentinels, duplicate elements, and rigorous time and space complexity analysis.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerSimulate one disc-flipping board game move across all eight directions
Simulate one move of a two-player disc-flipping board game: place a piece, flip every run of opponent pieces enclosed by the player's own pieces in all eight directions, and return the board unchanged when the move is illegal. It tests careful grid traversal, precise legality rules and avoiding partial updates.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerSolve LeetCode string and list problems
This set of problems evaluates proficiency in string manipulation, priority-queue/heap usage and greedy strategies, and linked-list operations including pointer management and cloning, reflecting core data structure and algorithm competencies.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerSolve Nearby Inventory and Word Segmentation Tasks
Implement two independent tasks: identify stocked centers close enough to a graph destination and return any exact dictionary segmentation of a string. Handle disconnected routes, duplicate edges, missing inventory, repeated suffix work, and large inputs while explaining complexity.
Coding & AlgorithmsOnsite
Amazon