Katkat

practice a little every day, paws crossed ♡

Coding & Algorithms 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 1531–1560 of 1706 results

  • Two SigmaEasyData Scientist
    Match readings with latest same-city humidity

    This question evaluates the ability to align and join time-ordered sensor data by key, testing skills in time-series merging, per-key state management, and handling absent matches.

    Coding & AlgorithmsTechnical Screen
  • 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
  • Two SigmaHardData Scientist
    Merge Two Sorted Lists

    This problem tests your ability to manipulate linked list pointers to merge two sorted sequences efficiently without allocating extra space for new nodes.

    Coding & AlgorithmsTechnical ScreenLinked ListsPointersRecursion
  • Two SigmaHardData Scientist
    Merge two sorted linked lists

    This problem tests your ability to manipulate linked list pointers to merge two sorted structures in-place, focusing on space optimization and handling edge cases.

    Coding & AlgorithmsTechnical ScreenLinked ListsPointersIn-place
  • Two SigmaMediumData Scientist
    Return sorted values after quadratic transform

    This problem tests your ability to efficiently transform elements in a sorted array using a quadratic function and merge them back into a single sorted array in linear time.

    Coding & AlgorithmsTechnical ScreenArraysTwo PointersSorting
  • UberEasyMachine Learning Engineer
    Analyze sales with groupby

    This question evaluates proficiency in data manipulation and analytics using pandas, specifically the ability to join relational tables and apply groupby aggregations to compute business metrics like total sales, average sales per order, and completion rates.

    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
  • UberMediumData Scientist
    Can one car serve all riders?

    This problem tests your ability to determine if a single resource (a car) can accommodate a series of scheduled tasks without overlap, requiring efficient sorting and comparison techniques.

    Coding & AlgorithmsTechnical ScreenSortingIntervalsGreedy
  • UberMediumData Scientist
    Compute CDF from a PDF Function

    This problem tests your understanding of numerical integration techniques (specifically the trapezoidal rule) and your ability to implement a functional mapping of a continuous probability density function (PDF) into a discrete cumulative distribution function (CDF).

    Coding & AlgorithmsTechnical ScreenNumerical MethodsProbabilityIntegration
  • UberMediumMachine Learning Engineer
    Compute currency conversion via graph search

    This question evaluates graph modeling and pathfinding with weighted edges, numerical reasoning about multiplicative rates and floating-point precision, and the ability to analyze algorithmic time and space complexity.

    Coding & AlgorithmsTechnical Screen
  • UberMediumData Scientist
    Compute maximum concurrent trips from intervals

    This question evaluates a candidate's skill in designing efficient algorithms for interval overlap counting, including event ordering, handling half-open interval edge cases, and reasoning about concurrent activity timing.

    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
  • UberMediumData Scientist
    Compute square root to 1 decimal

    This question evaluates a candidate's understanding of numerical methods, floating-point precision, and implementation of approximate functions when producing a square root rounded to one decimal place.

    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
  • UberMediumData Scientist
    Convert a PDF to a CDF

    This question evaluates understanding of probability theory, numerical methods, and algorithmic implementation for converting probability density functions into cumulative distribution functions, addressing analytic versus sampled PDFs along with support, normalization, and monotonicity requirements.

    Coding & AlgorithmsTechnical Screen
  • 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
  • UberMediumData Scientist
    Design airport dispatch with ETA uncertainty

    This question evaluates proficiency in online algorithm design under uncertainty, stochastic modeling of ETAs, multi-objective optimization for resource allocation, and streaming data handling relevant to dispatch systems.

    Coding & AlgorithmsTechnical Screen
  • 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
  • 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
  • UberHardMachine Learning Engineer
    Find Robots by Nearest-Blocker Distances

    Implement an algorithm to identify all robots in a grid whose four-directional distances to the nearest obstacle or grid boundary match a target query.

    Coding & AlgorithmsTechnical Screenmatrixprefix-sumhash-table
  • UberMediumMachine Learning Engineer
    Find a Black-Box Convex Function Minimum

    This question evaluates proficiency in zero-order optimization and algorithm design, focusing on reasoning about convexity and unimodality when only function evaluations are available.

    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
  • UberMediumMachine Learning Engineer
    Find robots in a grid whose four-direction distances to blockers match a query

    Given a grid of robots, blockers and empty cells plus a query of four distances, return every robot whose distances to the nearest blocker or grid edge going up, down, left and right match the query exactly. Tests precise distance definitions, boundary handling and scaling past a per-robot scan.

    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