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 3421–3450 of 3640 results
- 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 - 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 - UberMediumSoftware EngineerImplement rate limiter, top-K, scheduler algorithms
This question evaluates proficiency in concurrent programming and thread-safe design, core algorithm implementation (binary search and top-K logic), data structure usage (including doubly-linked-list techniques), and scheduling and ranking reasoning for meeting and resource allocation.
Coding & AlgorithmsOnsite - UberHardSoftware EngineerImplement three interview-style coding tasks
This set of tasks evaluates algorithm and data-structure design skills within the Coding & Algorithms domain, focusing on array windowing and range constraints, dynamic connectivity with component-size maintenance, and time-windowed streaming counters with per-user rate limiting.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerImplement uniform sampling in squares
Implement uniform sampling in squares 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 - UberHardData ScientistInvestigate ride declines and test free trials
This question evaluates proficiency in product analytics, cohort and funnel analysis, retention and supply diagnostics, pricing and subscription economics, and experimentation design.
Analytics & ExperimentationOnsite - UberHardSoftware EngineerMaximize stock profit with one or two trades
This question evaluates algorithmic problem-solving skills in array processing and transaction-constrained optimization, exercising greedy and dynamic programming concepts within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerMaximize the Eligible Carpool Group
This problem tests your ability to use a sweep-line algorithm or difference array to find the optimal point to maximize the number of overlapping intervals, subject to specific constraints.
Coding & AlgorithmsOnsiteArraySweep-linePrefix Sum - UberMediumSoftware EngineerModel user-to-resource access permissions in a graph database and migrate to it
Design how to store and check which people can access which resources using a graph database, including the vertex and edge schema, access-check traversals, and scaling with caching and partitioning. It also covers migrating from the existing database without downtime, testing access modeling, bounded traversals and safe data migration.
System DesignOnsite - UberHardSoftware EngineerObject-Oriented Parking Lot Design with Check-In and Check-Out
An object-oriented design interview question asking you to model a parking lot and implement working check-in and check-out methods. It tests class design and relationships, fast free-spot lookup across vehicle sizes, ticket handling, fees, edge cases, and thread safety.
Software Engineering FundamentalsOnsite - UberHardSoftware EngineerPrioritize rooms for allocation
This question evaluates a candidate's ability to design a real-time room allocation and ranking service in the System Design domain, testing competencies in architectural design, ranking and scoring functions, data sourcing and freshness, fairness mechanisms, and online evaluation and experimentation.
System DesignOnsite - UberMediumSoftware EngineerQuadtree for 2D Geospatial Points
This problem tests the implementation of a spatial indexing structure by requiring the construction of a Point Quadtree that recursively divides 2D space into four quadrants.
Coding & AlgorithmsOnsiteTreesGeometryRecursion - UberMediumSoftware EngineerReconstruct the Alphabet Order of an Alien Language
This question tests the ability to model partial ordering constraints using a directed graph and perform a topological sort to deduce a valid sequence.
Coding & AlgorithmsOnsiteGraphsTopological SortDFS - UberMediumSoftware EngineerRobot Grid Route with Charging Cells: Fewest Charges, Then Battery, Then Moves
A grid pathfinding problem in which a robot travels from a start cell to a destination through open, blocked and charging cells, spending one battery unit per move and refilling at chargers. The best route is ranked by fewest charging stops, then smallest required battery capacity, then fewest moves.
Coding & AlgorithmsOnsite - UberHardSoftware EngineerSchedule Non-Overlapping Meetings Efficiently
This problem tests your ability to manage dynamic intervals and determine if a new meeting can be scheduled without overlapping existing appointments using efficient data structures.
Coding & AlgorithmsOnsiteIntervalsBinary SearchSorting - UberMediumSoftware EngineerShortest Path in a Grid with Blocked Cells
This problem tests your ability to model a 2D grid as a graph and implement a Breadth-First Search (BFS) to find the shortest path between two points while respecting obstacles.
Coding & AlgorithmsOnsiteBFSGraphsGrid - UberMediumSoftware EngineerSimulate robot on grid with obstacles
Simulate robot on grid with obstacles 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 - UberMediumSoftware EngineerSolve BFS and grid tasks
This collection evaluates understanding of search techniques (binary search and BFS), graph and grid traversal, state-space shortest-path reasoning, randomized placement with adjacency counting, and attention to implementation quality and complexity trade-offs.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerSolve stock profit and vertical tree traversal
Assesses proficiency in array processing and binary tree traversal algorithms—specifically single-pass analysis of time-series data and coordinate-based vertical ordering of tree nodes; Category: Coding & Algorithms; Level of abstraction: implementation-level algorithmic coding.
Coding & AlgorithmsOnsite - Uber FreightMediumSoftware EngineerDesign a Distributed URL Shortener for Very High Redirect Traffic
A system design interview question asking you to design a distributed URL shortener. It tests API design, unique short-code and distributed ID generation, collision handling, storage and sharding, caching for very high redirect traffic, availability, fault tolerance, and link expiration.
System DesignOnsite - Uber FreightMediumSoftware EngineerDesign a Real-Time Restaurant Analytics Dashboard
This problem tests the ability to design a distributed, low-latency analytics pipeline capable of handling high-throughput event ingestion, time-windowed aggregations, and efficient cache retrieval.
System DesignOnsiteDistributed SystemsStreamingCaching - Uber FreightMediumSoftware EngineerLargest Rider Group Where Every Rider's Companion-Count Limits Hold
A coding problem about forming the largest group of riders for a shared car, where each rider accepts only a minimum and maximum number of fellow passengers. It tests reasoning about per-rider interval constraints, careful handling of group-size edge cases, and meeting a linear-time requirement.
Coding & AlgorithmsOnsite - Uber FreightMediumSoftware EngineerLow-Level Design of an In-Memory File System with mkdir and ls
A low-level design interview question asking you to model a basic in-memory file system that supports mkdir and ls. It tests entity and class design for files and directories, representing the directory hierarchy and parent-child links, path resolution, and clear operation semantics.
Software Engineering FundamentalsOnsite - UiPathEasyFrontend EngineerBuild an Event-Driven Folder Browser
This problem tests your ability to model hierarchical data structures and design an efficient state management strategy for an interactive UI component.
Software Engineering FundamentalsOnsiteData StructuresFrontend ArchitectureState Management - UnityMediumSoftware EngineerDesign a Feature Store for Offline Training and Low-Latency Online Serving
Design a feature store that ingests high-volume event data, produces point-in-time correct training sets, and serves the latest features at low latency in production. It tests streaming and batch feature computation, leakage-free historical joins, online store design, and keeping training and serving consistent.
ML System DesignOnsite - UnityMediumSoftware EngineerImplement a Lightweight ETL Pipeline Scheduler in Python
Implement a small Python scheduler that registers ETL tasks with dependencies and runs a pipeline so that each task executes only after its upstream tasks succeed. It tests clean interface design, dependency ordering with validation, failure and retry handling, and clear reporting of what happened to each task.
Software Engineering FundamentalsOnsite - UpstartEasyData ScientistAssess Probability of Heads in Coin Tosses
Assess Probability of Heads in Coin Tosses evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Statistics & MathOnsite - UpstartEasyData ScientistCalculate Expected Streaks in Coin Toss Sequence
Calculate Expected Streaks in Coin Toss Sequence evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Statistics & MathOnsite
Uber
Uber Freight
UiPath
Upstart