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 2191–2220 of 2336 results

  • UberMediumSoftware Engineer
    Find Any Available Meeting Room

    This question evaluates a candidate's competence in handling interval-based scheduling problems, specifically managing interval data and performing efficient searches within sorted bookings to detect potential overlaps.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Find a Bounded Subarray and Largest Square

    This question evaluates array manipulation and algorithmic problem-solving skills across two tasks: enforcing bounded value ranges within contiguous subarrays and identifying largest uniform square regions in binary matrices, exercising concepts such as range-tracking, efficient data structures, and dynamic programming.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Find earliest common meeting slot

    This problem tests interval management and the ability to find a common free window across multiple disjoint sets of busy times while respecting daily working constraints.

    Coding & AlgorithmsOnsiteIntervalsSortingGreedy
  • UberHardSoftware Engineer
    Find earliest time all riders become connected

    Assesses understanding of graph connectivity, temporal event processing, and dynamic graph data-structures for determining when a set of nodes becomes a single connected component.

    Coding & AlgorithmsOnsite
  • UberEasySoftware Engineer
    Find smallest start index avoiding left exit

    This question evaluates a candidate's ability to analyze reachability and cycle behavior in array-based functional graphs, testing competency in array manipulation, traversal, loop detection, and runtime optimization within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Find the Cheapest Valid Round Trip

    Find the cheapest round-trip flight pair satisfying a minimum stay duration constraint in linear time with deterministic tie-breaking.

    Coding & AlgorithmsOnsiteArraysSuffix MinimumTwo Pointers
  • UberMediumSoftware Engineer
    Find the First Unique Log

    This problem tests your ability to efficiently process a stream or list of logs to identify the first log entry that appears exactly once, emphasizing the use of hash maps and ordered tracking.

    Coding & AlgorithmsOnsiteHash MapArraysData Streams
  • UberMediumSoftware Engineer
    Find the K Closest Points to a Query Location

    This problem tests the ability to efficiently find the k nearest neighbors using a priority queue (max-heap) and custom sorting logic for tie-breaking.

    Coding & AlgorithmsOnsiteHeapGeometrySorting
  • UberMediumSoftware Engineer
    Group Anagrams

    This problem tests your ability to identify and implement an efficient grouping mechanism using hash maps to categorize strings by a common canonical form.

    Coding & AlgorithmsOnsiteHash TableStringSorting
  • UberMediumSoftware Engineer
    Implement Cache Eviction And Seat Assignment

    This problem tests your ability to combine a Least Recently Used (LRU) cache mechanism with a greedy strategy for geometric optimization in seat assignments.

    Coding & AlgorithmsOnsiteHash MapDoubly Linked ListGreedy
  • UberMediumSoftware Engineer
    Implement Minesweeper and Word Search

    This problem tests your ability to manipulate 2D grids using BFS/DFS for board traversal and randomized state generation.

    Coding & AlgorithmsOnsiteGridBacktrackingDFS
  • UberMediumSoftware Engineer
    Implement binary search from scratch

    An Uber software engineer onsite coding question asking you to implement binary search on a sorted integer array from scratch, in both iterative and recursive form. It covers plain search, first/last occurrence with duplicates, the insertion-index variant, overflow-safe midpoint computation, loop invariants and correctness, and time/space complexity analysis.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Implement rate limiter, top-K, scheduler algorithms

    This question evaluates proficiency in concurrent programming and thread-safe design, core algorithm implementation (binary search and top-K logic), data structure usage (including doubly-linked-list techniques), and scheduling and ranking reasoning for meeting and resource allocation.

    Coding & AlgorithmsOnsite
  • UberHardSoftware Engineer
    Implement three interview-style coding tasks

    This set of tasks evaluates algorithm and data-structure design skills within the Coding & Algorithms domain, focusing on array windowing and range constraints, dynamic connectivity with component-size maintenance, and time-windowed streaming counters with per-user rate limiting.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Implement uniform sampling in squares

    Implement uniform sampling in squares 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 & AlgorithmsOnsite
  • UberHardSoftware Engineer
    Maximize stock profit with one or two trades

    This question evaluates algorithmic problem-solving skills in array processing and transaction-constrained optimization, exercising greedy and dynamic programming concepts within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Maximize the Eligible Carpool Group

    This problem tests your ability to use a sweep-line algorithm or difference array to find the optimal point to maximize the number of overlapping intervals, subject to specific constraints.

    Coding & AlgorithmsOnsiteArraySweep-linePrefix Sum
  • UberMediumSoftware Engineer
    Model user-to-resource access permissions in a graph database and migrate to it

    Design how to store and check which people can access which resources using a graph database, including the vertex and edge schema, access-check traversals, and scaling with caching and partitioning. It also covers migrating from the existing database without downtime, testing access modeling, bounded traversals and safe data migration.

    System DesignOnsite
  • UberHardSoftware Engineer
    Object-Oriented Parking Lot Design with Check-In and Check-Out

    An object-oriented design interview question asking you to model a parking lot and implement working check-in and check-out methods. It tests class design and relationships, fast free-spot lookup across vehicle sizes, ticket handling, fees, edge cases, and thread safety.

    Software Engineering FundamentalsOnsite
  • UberHardSoftware Engineer
    Prioritize rooms for allocation

    This question evaluates a candidate's ability to design a real-time room allocation and ranking service in the System Design domain, testing competencies in architectural design, ranking and scoring functions, data sourcing and freshness, fairness mechanisms, and online evaluation and experimentation.

    System DesignOnsite
  • UberMediumSoftware Engineer
    Quadtree for 2D Geospatial Points

    This problem tests the implementation of a spatial indexing structure by requiring the construction of a Point Quadtree that recursively divides 2D space into four quadrants.

    Coding & AlgorithmsOnsiteTreesGeometryRecursion
  • UberMediumSoftware Engineer
    Reconstruct the Alphabet Order of an Alien Language

    This question tests the ability to model partial ordering constraints using a directed graph and perform a topological sort to deduce a valid sequence.

    Coding & AlgorithmsOnsiteGraphsTopological SortDFS
  • UberMediumSoftware Engineer
    Robot Grid Route with Charging Cells: Fewest Charges, Then Battery, Then Moves

    A grid pathfinding problem in which a robot travels from a start cell to a destination through open, blocked and charging cells, spending one battery unit per move and refilling at chargers. The best route is ranked by fewest charging stops, then smallest required battery capacity, then fewest moves.

    Coding & AlgorithmsOnsite
  • UberHardSoftware Engineer
    Schedule Non-Overlapping Meetings Efficiently

    This problem tests your ability to manage dynamic intervals and determine if a new meeting can be scheduled without overlapping existing appointments using efficient data structures.

    Coding & AlgorithmsOnsiteIntervalsBinary SearchSorting
  • UberMediumSoftware Engineer
    Shortest Path in a Grid with Blocked Cells

    This problem tests your ability to model a 2D grid as a graph and implement a Breadth-First Search (BFS) to find the shortest path between two points while respecting obstacles.

    Coding & AlgorithmsOnsiteBFSGraphsGrid
  • UberMediumSoftware Engineer
    Simulate robot on grid with obstacles

    Simulate robot on grid with obstacles 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 & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Solve BFS and grid tasks

    This collection evaluates understanding of search techniques (binary search and BFS), graph and grid traversal, state-space shortest-path reasoning, randomized placement with adjacency counting, and attention to implementation quality and complexity trade-offs.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Solve stock profit and vertical tree traversal

    Assesses proficiency in array processing and binary tree traversal algorithms—specifically single-pass analysis of time-series data and coordinate-based vertical ordering of tree nodes; Category: Coding & Algorithms; Level of abstraction: implementation-level algorithmic coding.

    Coding & AlgorithmsOnsite
  • Uber FreightMediumSoftware Engineer
    Design a Distributed URL Shortener for Very High Redirect Traffic

    A system design interview question asking you to design a distributed URL shortener. It tests API design, unique short-code and distributed ID generation, collision handling, storage and sharding, caching for very high redirect traffic, availability, fault tolerance, and link expiration.

    System DesignOnsite
  • Uber FreightMediumSoftware Engineer
    Design a Real-Time Restaurant Analytics Dashboard

    This problem tests the ability to design a distributed, low-latency analytics pipeline capable of handling high-throughput event ingestion, time-windowed aggregations, and efficient cache retrieval.

    System DesignOnsiteDistributed SystemsStreamingCaching