Katkat

practice a little every day, paws crossed ♡

Coding & Algorithms 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 31–60 of 427 results

  • AmazonMediumSoftware Engineer
    Find 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 Engineer
    Find 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 Engineer
    Find 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 Engineer
    Find 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 Engineer
    Find the K Most Frequent Values

    Find any valid set of the k most frequent distinct integers, handling boundary ties with frequency counting, bounded heaps, or frequency buckets.

    Coding & AlgorithmsOnline Assessment
  • AmazonHardSoftware Engineer
    Find the Largest Rating Threshold Supported by K Instances

    Find the largest k for which at least k instance ratings are at least k, handling threshold equality and the zero-answer case.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Find the Maximum Island Area

    Find the largest four-neighbor island area in a binary matrix, including the component-size challenges of row-by-row streaming.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Group Anagrams Without Sorted Character Signatures

    Group anagrams without sorting each word's characters, preserving repeated words and reasoning about frequency signatures and overflow-prone encodings.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Implement basic calculator

    This question evaluates skill in parsing and evaluating arithmetic expressions with integer operands and the operators +, -, *, and /, focusing on operator precedence and evaluation order within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Inventory Allocation by Bid Priority

    Implement a tiered inventory allocation system that distributes limited stock among buyer bids based on price tiers and round-robin priority rules.

    Coding & AlgorithmsOnline AssessmentSimulationSortingGreedy
  • AmazonMediumSoftware Engineer
    Max total of k consecutive bags over disjoint valued segments, modulo 1e9+7

    Disjoint segments [l, r, v] give every bag from position l to r the value v, and all other bags in an endless row are empty. Find the largest total over k consecutive bags, returned modulo 1,000,000,007, when k and positions reach 10^9, testing window sums over sparse ranges that cut through segments.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Maximize capacity with primary-backup pairing

    This problem tests your ability to optimize resource pairing using greedy strategies or sorting to maximize total capacity under specific pair-wise constraints.

    Coding & AlgorithmsOnline AssessmentGreedySortingOptimization
  • AmazonMediumSoftware Engineer
    Maximize credits with limited skips

    This question evaluates algorithm design and optimization skills in resource allocation under constraints, focusing on decision-making to maximize credits when turn-taking and limited skips affect processing.

    Coding & AlgorithmsOnline Assessment
  • AmazonHardSoftware Engineer
    Maximize memory capacity with primary-backup servers

    This question evaluates algorithmic reasoning in constrained pairings and resource allocation, focusing on maximizing aggregate memory under pairwise feasibility constraints while managing large input sizes.

    Coding & AlgorithmsOnline Assessment
  • AmazonHardSoftware Engineer
    Maximize protected population and bitwise AND

    This problem tests your ability to optimize resource allocation using greedy approaches with priority queues and bitwise bit-manipulation techniques to satisfy mathematical constraints.

    Coding & AlgorithmsOnline AssessmentGreedyBit ManipulationPriority Queue
  • AmazonMediumSoftware Engineer
    Maximize protected population with one-step guard shifts

    This question evaluates the ability to reason about constrained local moves and optimize a numerical objective over an array, testing skills in array manipulation, combinatorial optimization, and interpretation of binary state representations.

    Coding & AlgorithmsOnline Assessment
  • AmazonHardSoftware Engineer
    Maximize total bandwidth of data channel pairs

    This question evaluates a candidate's ability to design efficient algorithms for combinatorial optimization and selection under constraints, testing understanding of array manipulation, ordered pair counting, and aggregation of bandwidth sums.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Maximize weighted subsequence pairs with wildcards

    This question evaluates combinatorial counting, string manipulation, and optimization under constraints, along with handling large-number results via modular arithmetic.

    Coding & AlgorithmsOnline Assessment
  • AmazonHardSoftware Engineer
    Merge Two Job Queues With the Fewest Urgency Inversions

    Interleave two digit sequences, keeping each one's order, so that the merged sequence has as few inversions as possible. Tests charging each inversion to its earlier element, which turns the problem into an O(mn) grid DP.

    Coding & AlgorithmsOnline Assessmentdynamic-programmingstringsinversions
  • AmazonHardSoftware Engineer
    Minimize 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 Engineer
    Minimize 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 Engineer
    Minimize 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 Engineer
    Minimize 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
  • AmazonHardSoftware Engineer
    Minimize 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 Engineer
    Minimize 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 Engineer
    Minimum 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 Engineer
    Minimum 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 Engineer
    Simulate 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 Engineer
    Solve jumps and anagram-similarity problems

    This two-part question evaluates algorithmic problem-solving skills: Task A focuses on combinatorial optimization and cost-based sequencing under quadratic jump costs, while Task B assesses string multiset reasoning and character-frequency manipulation to determine anagram similarity.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Solve median extremes and segment flips

    Solve median extremes and segment flips 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 & AlgorithmsOnline Assessment