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 5491–5520 of 5874 results

  • 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
  • UberMediumSoftware Engineer
    Encode an N-ary tree as a string and decode it back to the identical tree

    Design a string format for rooted N-ary trees and implement serialize and deserialize so the decoded tree has the same values, shape and child order. It tests unambiguous encoding of variable child counts, linear-time parsing, iterative handling of very deep trees, and validation of malformed input.

    Software Engineering FundamentalsOnsite
  • UberMediumSoftware Engineer
    Evaluate an Arithmetic Expression

    This problem tests your ability to parse and evaluate mathematical expressions involving integers, addition, subtraction, multiplication, division, and parentheses using stacks or recursion.

    Coding & AlgorithmsOnsiteStackParsingString Manipulation
  • 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
  • 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 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 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
  • 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
  • UberMediumSoftware Engineer
    Find leftmost point of maximum brightness

    This question evaluates understanding of interval overlap counting, efficient use of ordered data structures for range events, tie-breaking logic, and robustness to numeric edge cases such as large coordinates and floating-point radii.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Find minimum activations to absorb all balls

    This question evaluates the ability to model Euclidean-distance relations as a static connectivity graph and reason about the minimum number of activations needed to absorb all nodes, testing computational geometry and graph algorithms competency.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Find minimum reversals to orient edges away from root

    This question evaluates understanding of directed graphs and rooted trees, the ability to reason about edge orientations and minimal reversals, and competency in traversal techniques and complexity analysis.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Find next and closest palindromes

    This question evaluates string-based numeric manipulation and palindrome construction, including edge-case handling (all 9s, single-digit inputs, length changes), candidate generation and magnitude comparison of large numbers as strings, and carry propagation for fixed-length decimal palindromes.

    Coding & AlgorithmsOnline Assessment
  • 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
  • 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 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
    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