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 2431–2460 of 5874 results

  • GoogleMediumSoftware Engineer
    Implement iterator merging lists with filtering

    This problem tests your ability to design a stateful iterator that performs a multi-way merge on sorted streams while applying filtering and deduplication logic on the fly.

    Coding & AlgorithmsTechnical ScreenIteratorsHeapMerge K Sorted
  • GoogleMediumSoftware Engineer
    Implement matrix transforms and discuss eigenvalues

    This problem tests your ability to perform in-place 2D matrix transformations and your conceptual understanding of how linear algebraic properties like eigenvalues describe matrix behavior.

    Software Engineering FundamentalsOnsiteArraysMatricesLinear Algebra
  • GoogleMediumSoftware Engineer
    Implement quicksort and a binary search tree, and explain how each works internally

    Implement quicksort and a binary search tree from scratch and explain how each works internally, including partitioning, pivot choice, insertion, search and deletion. Tests correctness invariants, best, average and worst-case complexity, duplicate and sorted inputs, alternative approaches, and how library implementations differ.

    Software Engineering FundamentalsTechnical Screen
  • GoogleEasySoftware Engineer
    Implement string formatting and request tracking tasks

    This question tests string manipulation, character mapping logic for rotational symmetry, and the ability to manage time-ordered event tracking using appropriate data structures.

    Coding & AlgorithmsTechnical ScreenStringsTwo PointersHash Maps
  • GoogleMediumSoftware Engineer
    Implement text wrapping, waitlist, and intervals

    This problem tests your ability to implement a greedy word-wrapping algorithm and a custom queue data structure that supports efficient deletions based on time intervals.

    Coding & AlgorithmsOnsiteGreedyString ManipulationData Structures
  • GoogleHardSoftware Engineer
    Infection Spread on a Grid (Cellular Automaton)

    Implement an optimized discrete-time cellular automaton simulating epidemic spread on a 2D grid with recovery durations, barriers, and multi-neighbor infection thresholds.

    Coding & AlgorithmsTechnical ScreenBreadth-First SearchSimulationMatrix
  • GoogleMediumSoftware Engineer
    Intervals with Exactly X Concurrent Meetings

    Implement an algorithm to identify all maximal time intervals during which exactly X meetings overlap, using a sweep-line technique over half-open intervals.

    Coding & AlgorithmsOnsitesweep-lineintervalssorting
  • GoogleMediumSoftware Engineer
    Largest-Area Rectangle From a Point Set When Sides Need Not Be Axis-Aligned

    Given distinct integer points in the plane, return the largest area of a rectangle whose four corners are input points, where the rectangle may be rotated rather than aligned with the axes. It tests the geometric characterization of rectangles, grouping point pairs efficiently, and exact integer arithmetic.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Layer Config Trees with Pluggable Per-Path Merge Strategies

    Combine a default configuration tree with an environment overlay where each path can pick a merge strategy such as deep, override, preserve, concat, union, or keyed list matching, and new strategies plug in without touching the traversal. Tests simultaneous tree recursion, registry-based extensibility, ordering rules and type-conflict handling.

    Software Engineering FundamentalsTechnical Screenrecursiontreesextensibility
  • GoogleMediumSoftware Engineer
    Lead a Project Through Ambiguous Requirements

    This question evaluates your ability to take ownership of ambiguous, loosely defined technical initiatives, structure unknown variables, validate assumptions through experiments, and pivot effectively based on emerging data.

    Behavioral & LeadershipOnsiteBehavioralLeadershipAmbiguity
  • GoogleMediumSoftware Engineer
    Lead a deep dive on your most complex project

    This question evaluates a candidate's systems architecture and technical leadership skills, including design reasoning, trade-off analysis, incident management, and reflective learning.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    Leading an Engineering Team Back From Low Morale

    A behavioral question for an engineering manager candidate about leading a team whose morale had dropped. It tests how the candidate reads the signals, diagnoses causes through one-on-ones and data, acts on causes inside and outside their control, communicates honestly, and shows that the team recovered.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    Load a Delivery Van With Equal-Size Crates for Maximum Profit

    Pick crates from limited stock to fill a van whose slots can number in the billions, when every crate takes one slot; recognize that the scary-looking bounded knapsack collapses to a greedy, then answer many capacity queries fast.

    Coding & AlgorithmsTechnical Screengreedysortingprefix-sums
  • GoogleMediumSoftware Engineer
    Maintain k-th largest in a stream

    This question evaluates understanding of data structures and streaming algorithms for maintaining k-th order statistics under dynamic inserts, emphasizing time-space trade-offs and correct handling of duplicates.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Maintain streaming median and loosemedian

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Maintain streaming median and loosemedian states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Managing Delivery Dates When a Team Commitment Is at Risk

    A behavioral question for an engineering manager on how they set, track and protect delivery dates, followed by a real case where a committed date was at risk. It tests early risk detection, weighing scope, staffing and date options, stakeholder communication, and protecting quality and team health.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    Match Dictionary Words to a Swipe-Keyboard Gesture Path

    A coding problem modeled on a swipe keyboard: given the ordered keys a finger passed over and a dictionary, return every word the gesture could spell. It tests precise handling of the start and end keys, doubled letters and duplicate words, and efficient matching of many dictionary words against one gesture path.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Match Tagged Problems to Skilled Programmers at Scale

    Design a distributed matching platform that pairs incoming tagged tasks with skilled programmers using graph algorithms at scale.

    System DesignOnsitesystem-designgraph-algorithmsdistributed-systems
  • GoogleMediumSoftware Engineer
    Match people to questions using tags and priorities

    This problem tests your ability to model a constrained matching problem using greedy or flow-based approaches while managing priority queues for tie-breaking.

    Coding & AlgorithmsTechnical ScreenGreedyHeapsSorting
  • GoogleMediumSoftware Engineer
    Maximize 1D deliveries within distance and minimize total distance

    This problem tests your ability to prioritize objectives using a greedy strategy or sorting to maximize deliveries while minimizing travel cost within a constrained route.

    Coding & AlgorithmsTechnical ScreenSortingGreedyOptimization
  • GoogleMediumSoftware Engineer
    Maximize Boundary-Difference Subarray Sum

    This question evaluates algorithmic problem-solving skills with emphasis on array processing, constrained subarray sums, and the design of time- and space-efficient algorithms within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Maximize Throughput Packing Reserved Compute Slots With Limited Stock

    Choose how many reserved instances of each type to allocate into a shared rack-slot budget, each instance occupying exactly one slot, to maximize total throughput score given limited stock per type.

    Coding & AlgorithmsTechnical Screenknapsackgreedysorting
  • GoogleMediumSoftware Engineer
    Maximize coins collected by 3-step pieces

    This question evaluates modeling and optimization of discrete state-space transitions under movement constraints, testing combinatorial reasoning, reachability, and resource-maximization competencies.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Maximize coins collected by tokens jumping +3

    Evaluates algorithmic reasoning about constrained discrete moves and optimization, focusing on state-space modeling, reachability under move constraints, and resource-maximization techniques.

    Coding & AlgorithmsOnline Assessment
  • GoogleMediumSoftware Engineer
    Maximize sum without choosing adjacent elements

    This problem tests your ability to solve optimization challenges using dynamic programming by identifying overlapping subproblems and optimal substructure in an array.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingArrayOptimization
  • GoogleMediumSoftware Engineer
    Maximize the Equal Wood Segment Length

    Tests the ability to solve an optimization problem by applying binary search over a monotonic search space (binary search on answer).

    Coding & AlgorithmsOnsitebinary-searcharraysgreedy
  • GoogleMediumSoftware Engineer
    Maximum Value from Unit-Weight Items with Limited Copies Under a Capacity

    Find the maximum total value that fits in a bag whose capacity can reach one billion units, when every item weighs one unit and each item type has a value and a limited number of identical copies. Tests judging which knapsack techniques scale to huge capacities and copy counts, plus 64-bit arithmetic for large totals.

    Coding & AlgorithmsTechnical Screen
  • GoogleHardSoftware Engineer
    Merge Two Named Trees: First Tree's Names and Order, Second Tree's Values

    Merge two trees whose nodes carry a name, an integer value and an ordered list of children, keeping the first tree's names and child order while taking values from the second. Same-name children pair up by order of appearance and second-tree leftovers are appended, testing careful recursive construction from a rule-heavy specification.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Merge Two YAML Configuration Trees with Per-Node Merge Rules

    Merge two configuration trees parsed from YAML files, where each node can follow its own merge rule, such as recursive merging, replacing, keeping, appending lists, or matching list items by a key field. Tests recursive traversal of two trees, an extensible way to apply many rules, and careful handling of ordering, one-sided keys and type conflicts.

    Software Engineering FundamentalsTechnical Screen
  • GoogleMediumSoftware Engineer
    Min deletions to avoid overlap in first k

    This problem tests your ability to identify and remove the minimum number of elements from an array such that a specified prefix contains only unique elements.

    Coding & AlgorithmsTechnical ScreenArraysHash MapsGreedy