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 2371–2400 of 2629 results

  • UberHardSoftware Engineer
    Count Islands of Connected Land Cells in a Binary Grid

    A classic grid coding problem asking you to count the islands formed by horizontally or vertically connected land cells in a binary grid. It tests grid traversal, connected-component counting, and careful handling of grid boundaries and already visited cells.

    Coding & AlgorithmsOnsite
  • UberHardSoftware Engineer
    Count Palindromic Ancestor Paths

    This problem tests your ability to use bit manipulation and prefix properties on trees to solve path-related queries efficiently, specifically focusing on the property that a set of characters can form a palindrome if at most one character has an odd frequency.

    Coding & AlgorithmsOnline AssessmentBit ManipulationTreesDFS
  • UberMediumSoftware Engineer
    Count Valid Infection Orders

    This problem tests your ability to use combinatorial counting and dynamic programming to determine the number of valid sequences in which a population can be infected under specific adjacency constraints.

    Coding & AlgorithmsOnsiteDynamic ProgrammingCombinatoricsAlgorithms
  • UberMediumSoftware Engineer
    Count paths with prime-ending jumps

    This question evaluates a candidate's ability to design and implement dynamic programming for counting paths, combining combinatorial reasoning with modular arithmetic and handling step-size constraints tied to primes ending in digit 3.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Count subarrays with at least k fruit pairs

    This question evaluates algorithmic problem-solving focused on frequency-based counting and efficient enumeration of subarrays, testing competence in designing subquadratic solutions and selecting appropriate data representations within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Count subarrays with ≥k identical pairs

    This question evaluates proficiency in array algorithms, frequency-based counting and combinatorial reasoning for identifying equal-element pairs within contiguous subarrays.

    Coding & AlgorithmsOnline Assessment
  • 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 top-K frequency structure

    This question evaluates ability to design efficient in-memory data structures for frequency tracking, including handling recency-based tie-breaking, memory bounds under churn, and concurrency implications.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Design top-K tracker with linked lists

    Design top-K tracker with linked lists 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
    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
    Determine balanced k values in a permutation

    This question evaluates algorithmic reasoning about permutations and contiguous subarray properties, testing skills in array manipulation, positional reasoning, combinatorial insight, and complexity-aware algorithm design within the Coding & Algorithms domain.

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