practice a little every day, paws crossed ♡
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 8761–8790 of 9403 results
- UberHardSoftware EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 - UberMediumData ScientistFind the Next Larger Palindrome
This question evaluates proficiency in numeric and string manipulation, algorithmic thinking, and edge-case reasoning related to palindromic number generation.
Coding & AlgorithmsOnsite - UberMediumTechnical Program ManagerFix unclear delivery addresses
Diagnose and fix unclear delivery addresses in a marketplace delivery product. Covers root-cause analysis, risky-address detection, address validation, courier recovery, metrics, guardrails, and phased rollout.
Product / Decision MakingTechnical Screen - UberMediumData ScientistFormulate OR model to reduce driver backtracking
This question evaluates skills in defining a quantitative driver-backtracking metric from GPS and assignment logs, detecting and validating backtracking segments, and formulating constrained optimization models for dispatch and repositioning, drawing on statistics, operations research, and stochastic optimization.
Statistics & MathOnsite - UberHardData ScientistFormulate hypotheses and compute AB test significance
This question evaluates a data scientist's competency in experimental design and statistical inference for A/B testing, covering hypothesis formulation, difference-in-proportions testing and confidence intervals, guardrail analysis, multiple-testing correction, interim alpha-spending approaches, and variance-reduction techniques such as CUPED.
Statistics & MathTechnical Screen - UberMediumSoftware EngineerGroup 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 EngineerGroup 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 EngineerHandle 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 - UberEasyData ScientistHow to experiment on ETA reduction
This problem tests the ability to design an A/B test for product improvements and address potential confounding factors like selection bias and spillover effects.
Analytics & ExperimentationTechnical ScreenA/B TestingCausal InferenceMarketplace Dynamics - UberMediumData ScientistHow would you build UberEats ranking?
This question assesses the ability to design an end-to-end ranking system for a food delivery platform, focusing on objective formulation, feature selection, and the trade-offs between relevance and business constraints.
Machine LearningTechnical ScreenRecommender SystemsLearning to RankFeature Engineering - UberEasyData ScientistHow would you design an ETA prediction system?
This problem tests the ability to design an end-to-end machine learning system for predicting ride arrival times, focusing on feature selection, model architecture, and evaluation strategies.
Machine LearningTechnical ScreenML System DesignRegressionFeature Engineering - UberMediumMachine Learning EngineerImplement 1D convex minimization in Python
An Uber Machine Learning Engineer technical-screen question on derivative-free 1D convex optimization: minimize a black-box convex function on a closed interval using only function evaluations. It tests method selection (golden-section vs ternary search), stopping criteria and tolerances, function-evaluation and time/space complexity analysis, and robust handling of flat regions, boundary optima, noisy evaluations, and numerical precision.
Machine LearningTechnical Screen - UberMediumSoftware EngineerImplement 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 - UberMediumMachine Learning EngineerImplement CLIP Contrastive Loss
This question evaluates understanding and implementation of contrastive representation learning concepts—specifically similarity matrices, symmetric image-text contrastive loss, normalization, temperature scaling, and label construction—testing competency in building losses for embedding alignment in the Machine Learning domain.
Machine LearningTechnical Screen - UberMediumSoftware EngineerImplement 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 - UberMediumData ScientistImplement FizzBuzz
This problem tests foundational programming skills by requiring the implementation of conditional logic and string manipulation based on modular arithmetic patterns.
Coding & AlgorithmsOnsiteAlgorithmsControl FlowStrings - UberMediumSoftware EngineerImplement 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 EngineerImplement 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 - UberMediumMachine Learning EngineerImplement Multi-Head Self-Attention
This question tests the ability to implement the multi-head self-attention mechanism from scratch using PyTorch, focusing on tensor manipulation, linear projections, and the scaled dot-product attention formula.
Machine LearningTechnical ScreenPyTorchDeep LearningTransformers - UberMediumSoftware EngineerImplement 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 - UberMediumData ScientistImplement Streaming Clustering for Numbers
This question evaluates a data scientist's competency in online clustering for numeric streams, testing understanding of streaming algorithms, bounded-memory cluster summaries, online updates, and issues including initialization, convergence behavior, outlier handling, and concept drift.
Machine LearningOnsite - UberMediumMachine Learning EngineerImplement a Referral Revenue Tracker
This question evaluates proficiency with data structures and algorithms for hierarchical aggregation and ranking, assessing skills such as maintaining recursive subtree aggregates, handling dynamic inserts, and executing efficient top-k queries; it is in the Coding & Algorithms domain and tests practical application of in-memory data structure design. It is commonly asked to evaluate the ability to design scalable, low-latency in-memory systems that preserve aggregate values across referral trees and support fast query operations while reasoning about time and space complexity trade-offs.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerImplement 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 - UberMediumMachine Learning EngineerImplement linear and logistic regression
This question evaluates understanding and hands-on implementation of linear and logistic regression, testing competencies in prediction functions, loss formulation, gradient computation, gradient descent training, regularization, and model selection within the Machine Learning domain (supervised learning and statistical modeling).
Machine LearningTechnical Screen
Uber