Katkat

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 481–510 of 5874 results

  • AmazonEasySoftware Engineer
    Make Progress When Requirements Are Ambiguous

    This question assesses the candidate's ability to navigate project uncertainty by balancing proactive momentum with risk management and stakeholder alignment.

    Behavioral & LeadershipTechnical ScreenLeadershipAmbiguityCommunication
  • AmazonMediumSoftware Engineer
    Make a Difficult Decision Under Competing Constraints

    Tests your ability to navigate high-stakes technical or organizational trade-offs where constraints conflict, evaluate options objectively, communicate decisions with transparency, and take ownership of the outcomes.

    Behavioral & LeadershipOnsiteBehavioralAmazon Leadership PrinciplesDecision Making
  • AmazonMediumSoftware Engineer
    Make an Important Decision Before Every Option Can Be Explored

    Explain a time-limited decision by identifying essential evidence, accepted uncertainty, reversible steps, stakeholder communication, and outcome checks.

    Behavioral & LeadershipOnsite
  • AmazonMediumSoftware Engineer
    Making a Decision with Missing Data

    Tests a candidate's ability to demonstrate Amazon's 'Bias for Action' and 'Are Right, A Lot' leadership principles by executing a calculated, high-impact decision under uncertainty with clear rollback triggers.

    Behavioral & LeadershipOnsiteBehavioralBias for ActionDecision Making
  • AmazonMediumSoftware Engineer
    Manipulate time-series with Pandas groupby

    This question evaluates proficiency in time-series data manipulation, including timezone-aware datetime parsing and DST handling, groupby and rolling-window aggregations, resampling to fill calendar gaps, and user-level retention and DAU calculations using idiomatic, vectorized Pandas or SQL operations.

    Data Manipulation (SQL/Python)Technical Screen
  • 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
  • AmazonHardSoftware Engineer
    Maximize Money in K Consecutive Bags

    This problem tests your ability to efficiently manage interval operations and sliding window logic on a sparse coordinate system.

    Coding & AlgorithmsTechnical ScreenSliding WindowSortingTwo Pointers
  • AmazonMediumSoftware Engineer
    Maximize Value Under a Budget

    This problem tests your ability to solve a variation of the 0/1 Knapsack problem where items must be selected to maximize total value without exceeding a specific budget constraint.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingOptimizationAlgorithms
  • 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
  • AmazonMediumSoftware Engineer
    Maximum Profit Assigning Tasks to Exact-Skill Workers Plus One Wildcard Worker

    Assign tasks to workers whose skill must exactly equal each task's requirement, with one extra worker who may take any single task, and return the maximum total profit. It tests making the best use of limited workers per skill level, the single wildcard worker, and large sums that exceed 32 bits.

    Coding & AlgorithmsOther
  • AmazonMediumSoftware Engineer
    Measure platform success and drive adoption

    This question assesses your ability to design a telemetry and feedback system for an internal developer platform to measure adoption, identify friction points, and drive cross-team migration.

    System DesignOnsiteTelemetryDeveloper ExperienceMetrics
  • AmazonMediumSoftware Engineer
    Median of a Data Stream

    Design a data structure that continuously receives a stream of integers and efficiently supports retrieving the current running median, handling potential integer overflow during the median calculation.

    Coding & AlgorithmsOnsiteHeapData StreamDesign
  • AmazonMediumSoftware Engineer
    Merge K Sorted Arrays Without Duplicates

    This problem tests your ability to efficiently merge multiple sorted sequences into a single sorted stream while managing duplicate values using a priority queue.

    Coding & AlgorithmsTechnical ScreenHeapsSortingArrays
  • AmazonMediumSoftware Engineer
    Merge Multiple Sorted Arrays

    This problem tests your ability to efficiently merge multiple sorted arrays into a single sorted list using a priority queue (min-heap) to optimize performance.

    Coding & AlgorithmsTechnical ScreenArraysHeapSorting
  • 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
  • AmazonMediumSoftware Engineer
    Merge overlapping and adjacent ranges

    This question evaluates a candidate's understanding of interval merging and range manipulation, including handling overlapping and adjacent ranges, edge cases like single-point gaps and extreme values, and the ability to analyze time and space complexity.

    Coding & AlgorithmsOnsite
  • AmazonHardSoftware Engineer
    Merge two sorted arrays in-place

    This problem tests your ability to manipulate arrays in-place while managing constraints to avoid unnecessary data movement or auxiliary space usage.

    Coding & AlgorithmsTechnical ScreenArraysTwo PointersIn-place
  • AmazonMediumSoftware Engineer
    Message Rate Limiter

    Design an in-memory message rate limiter that allows or denies messages based on whether a given time window has elapsed since their last accepted occurrence.

    Coding & AlgorithmsOnsiteHash MapDesignRate Limiter
  • 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
  • AmazonMediumSoftware Engineer
    Minimize 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 Engineer
    Minimize 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