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 2401–2430 of 2629 results

  • 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
    Group strings that are anagrams

    This problem tests your ability to efficiently group strings by their character composition using hash maps or sorting techniques.

    Coding & AlgorithmsTechnical ScreenHash MapStringSorting
  • UberMediumSoftware Engineer
    Handle invalid Lisp expression parsing

    This question evaluates the ability to parse and evaluate nested Lisp-like expressions, manage variable bindings and scope resolution, and detect malformed input and syntax errors.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Implement 2D word search variants and analyze complexity

    This question evaluates proficiency in grid-based string search, traversal techniques (fixed-direction scanning versus flexible-path exploration), algorithm design including backtracking/DFS, and the ability to analyze time and space complexity while accounting for redundancy and edge cases.

    Coding & AlgorithmsTechnical Screen
  • 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 Last-Click Attribution APIs

    This problem tests your ability to process streams of events to perform stateful attribution, requiring efficient data structures to track user sessions and match conversions to the most recent preceding click.

    Coding & AlgorithmsTechnical ScreenData StructuresAlgorithmsState Management
  • 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 Store Autocomplete

    This problem tests proficiency with prefix-based data structures and efficient string retrieval, specifically requiring a design that optimizes for frequent search operations over a static list of store names.

    Coding & AlgorithmsTechnical ScreenTrieString ManipulationData Structures
  • 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
  • UberMediumSoftware Engineer
    Kth Employee Reached in an Ordered Hierarchy

    This problem tests tree traversal techniques, specifically finding the k-th node in an in-order traversal of a binary search tree while handling dynamic updates or specific subtree constraints.

    Coding & AlgorithmsOnline AssessmentTreesBinary Search TreeTraversal
  • UberMediumSoftware Engineer
    Last Truck to Leave a One-Dimensional Lane

    Determine the time and ID of the last truck to exit a one-dimensional lane where trucks travel at constant speed and reverse directions upon colliding.

    Coding & AlgorithmsOnline AssessmentArraysSortingBrainteaser
  • UberHardSoftware Engineer
    Maintain the First Value That Appears Exactly Once

    Practice a Uber coding interview problem focused on maintain the first value that appears exactly once. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.

    Coding & AlgorithmsTechnical Screen
  • UberHardSoftware Engineer
    Maximize Minimum Scaled Value

    This problem tests your ability to use binary search on the answer space to solve a constrained resource allocation problem effectively.

    Coding & AlgorithmsOnline AssessmentBinary SearchGreedyOptimization
  • UberMediumSoftware Engineer
    Maximize Throughput and Count Trigger Components

    This problem tests your ability to optimize resource allocation using a greedy strategy and to identify connected components in a grid-based graph using traversal techniques.

    Coding & AlgorithmsTechnical ScreenGreedyGraphsBFS/DFS
  • 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
  • UberHardSoftware Engineer
    Maximum Score with Prime Jumps

    This problem tests dynamic programming and number theory, specifically the ability to combine linear path traversal with jump-based transitions constrained by prime number properties.

    Coding & AlgorithmsOnline AssessmentDynamic ProgrammingPrime NumbersGraph Traversal
  • UberMediumSoftware Engineer
    Minimum Delivery Cost Between Cities

    This problem tests your ability to optimize pathfinding costs in a graph where edge weights are determined by a combination of absolute differences and conditional local minimums.

    Coding & AlgorithmsOnline AssessmentGraphsShortest PathGreedy
  • UberMediumSoftware Engineer
    Parse and evaluate nested expressions with validation

    This question evaluates a developer's ability to design and implement a robust parser and evaluator for a parenthesized expression language, testing parsing, lexical scoping and variable binding, operator semantics, error detection, and safe integer arithmetic.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Print directory tree with indentation

    This question evaluates proficiency with representing and traversing hierarchical directory trees and producing depth-based formatted output, testing concepts such as tree traversal, recursion or iterative depth tracking, and string formatting for indentation.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Produce a valid deployment order

    This question evaluates proficiency in graph algorithms and dependency resolution, including concepts such as topological ordering, cycle detection, and complexity analysis, plus systems-level reasoning about service deployment dependencies.

    Coding & AlgorithmsTechnical Screen
  • 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
    Return a Package Build Order

    This question evaluates a candidate's skills in dependency resolution, graph traversal and cycle detection while reasoning about an externally discovered dependency subgraph and ordering constraints.

    Coding & AlgorithmsTechnical Screen