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 2611–2640 of 2810 results

  • Two SigmaHardSoftware Engineer
    Implement an In-Memory Database

    This question evaluates competence in implementing in-memory relational data structures, parsing tokenized database-like commands, and evaluating compound predicates with comparison operators.

    Coding & AlgorithmsTechnical Screen
  • Two SigmaHardSoftware Engineer
    Implement binary encode/decode with frequency tree

    This question evaluates understanding of frequency-based binary encoding and decoding, including deterministic tree construction, tie-breaking rules, and traversal, and tests knowledge of trees, priority queues, greedy algorithms, and bit-level string manipulation in the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • Two SigmaMediumSoftware Engineer
    Match Limit Orders with Price-Time Priority

    Implement a limit order matching engine adhering to price-time priority (FIFO), resting-order execution pricing, and partial fill mechanics.

    Coding & AlgorithmsTechnical ScreenHeapData StructuresSimulation
  • Two SigmaMediumSoftware Engineer
    Maximize Capital by Completing at Most k Projects

    This question evaluates algorithmic problem-solving and optimization skills within the Coding & Algorithms domain, focusing on selection under resource and operation constraints and reasoning about time and space complexity.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Bracket substrings matching any pattern

    This problem tests your ability to efficiently match and replace substrings based on a set of predefined patterns, prioritizing matches based on position and length.

    Coding & AlgorithmsTechnical ScreenStringsGreedyPattern Matching
  • UberMediumSoftware Engineer
    Build a Quadtree and Analyze a Graph

    This question evaluates skills in spatial data structures and recursive tree construction (building a quadtree) as well as graph analysis using traversal and cycle/safety detection to identify nodes that necessarily reach terminal nodes.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Compute outer boundary of an N-ary tree

    This question evaluates proficiency in tree data structures and algorithm design, focusing on traversal and boundary extraction in ordered N-ary trees while requiring time and space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Compute time for virus to infect grid

    This question tests the ability to model state propagation in a 2D grid using a Breadth-First Search (BFS) approach to determine the minimum time required for a condition to cover all cells.

    Coding & AlgorithmsTechnical ScreenBFSGraphGrid
  • UberMediumSoftware Engineer
    Deep Equality of Two Records

    This problem tests your ability to recursively compare two complex, nested data structures while handling different types like dictionaries, lists, and primitives.

    Coding & AlgorithmsTechnical ScreenRecursionData StructuresHash Maps
  • UberMediumSoftware Engineer
    Design Stock Price Alerts

    This question evaluates a candidate's ability to design scalable, low-latency alerting and notification systems, covering system architecture, APIs, data modeling, event-driven alert evaluation, deduplication, and multi-channel delivery; it is in the System Design category and assesses practical application skills.

    System DesignTechnical Screen
  • UberMediumSoftware Engineer
    Design a Food-Delivery Backend (Uber Eats-style)

    This problem evaluates your ability to design a distributed system that manages real-time interactions between three distinct user types: customers, restaurants, and couriers, with a focus on geospatial querying and high-concurrency event streaming.

    System DesignTechnical ScreenMicroservicesGeospatialCaching
  • UberMediumSoftware Engineer
    Design a Rolling Event Counter

    This question evaluates understanding of data structures and time-windowed counting, performance and memory trade-offs, expiration policies, and concurrency when implementing an in-memory rolling event counter.

    Software Engineering FundamentalsTechnical Screen
  • UberMediumSoftware Engineer
    Design an Iterative Path Tree and Clarify File Lookup Semantics

    Design an in-memory directory tree supporting iterative path insertion and file lookup using an explicit stack. The problem tests handling of duplicate component names, memory-efficient tree representation, and clarifying ambiguous file search contracts.

    Software Engineering FundamentalsTechnical ScreenTreeDFSDesign
  • UberMediumSoftware Engineer
    Design an object-oriented parking lot system

    This question evaluates object-oriented design competency, including class modeling, responsibility assignment, relationships (inheritance and composition), and familiarity with design patterns and SOLID principles for representing constraints like spot sizes and vehicle types.

    Software Engineering FundamentalsTechnical Screen
  • UberMediumSoftware Engineer
    Design cart management lifecycle service

    This question evaluates system design and backend engineering competencies, focusing on data modeling, indexing strategy, concurrency control, transactional correctness, and scalability for a multi-device cart lifecycle and one-time checkout.

    System DesignTechnical Screen
  • UberMediumSoftware Engineer
    Design follow/follower classes

    This problem tests your ability to design a system for managing directed relationships between users, requiring careful selection of data structures to balance write performance and query latency.

    Software Engineering FundamentalsTechnical ScreenOODGraphsData Structures
  • UberHardSoftware Engineer
    Determine Whether a Word Exists in a Character Grid

    Practice a Uber coding interview problem focused on determine whether a word exists in a character grid. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Develop test plan and TDD for word search

    This question evaluates a candidate's competency in designing comprehensive test plans and test-driven development workflows for grid-based word search algorithms, covering edge-case identification, input normalization, path validity, and performance/stress considerations within software testing and algorithmic reasoning.

    Software Engineering FundamentalsTechnical Screen
  • UberEasySoftware Engineer
    Find Earliest Column With One

    This question tests the ability to optimize searches in a sorted binary matrix by minimizing expensive API calls through efficient traversal techniques.

    Coding & AlgorithmsTechnical ScreenBinary SearchOptimizationMatrix
  • UberMediumSoftware Engineer
    Find Earliest Full Connectivity Timestamp

    This question evaluates understanding of graph connectivity and temporal event processing, examining how pairwise interactions over time can merge components into a single connected set.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Find Kth Smallest in BST

    This question evaluates understanding of binary search tree properties, ordered data retrieval, and algorithmic efficiency in locating the k-th smallest element.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Find a Lexicographically Optimal Robot Path with Charging Cells

    Find a path in a grid from start to target that lexicographically minimizes charging stations used, peak battery segment length, total moves, and breaks ties by flattened cell indices.

    Coding & AlgorithmsTechnical ScreenGraphBFSShortest Path
  • UberMediumSoftware Engineer
    Find all dictionary words in a grid

    This problem tests your ability to navigate a 2D grid using backtracking and optimize dictionary lookups using a Trie data structure.

    Coding & AlgorithmsTechnical ScreenDFSBacktrackingTrie
  • UberHardSoftware Engineer
    Find cheapest flight with at most K stops

    This question evaluates graph algorithm proficiency and problem-modeling skills, specifically working with directed weighted graphs to optimize path cost under a constraint on intermediate stops.

    Coding & AlgorithmsTechnical Screen
  • UberHardSoftware Engineer
    Find robots matching obstacle-distance signature

    This problem tests spatial reasoning, multi-source Breadth-First Search (BFS) for distance mapping, and pattern matching within 2D grids.

    Coding & AlgorithmsTechnical ScreenBFSDynamic ProgrammingMatrix
  • UberMediumSoftware Engineer
    Find shortest jumps in circular array

    This question evaluates graph-traversal and modular arithmetic skills by requiring modeling a circular array as a state graph and determining reachability and minimum-distance jumps under wrap-around constraints.

    Coding & AlgorithmsTechnical Screen
  • UberMediumSoftware Engineer
    Find the Best Currency Conversion Rate

    Find the largest conversion factor obtainable between two currencies in a directed graph where rates multiply along each path. Handle parallel rates, unreachable targets, identical currencies, cycles, and floating-point tolerance under a finite-optimum guarantee.

    Coding & AlgorithmsTechnical Screen
  • 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
    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 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