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 991–1020 of 1080 results
- 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 - 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 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 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 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 - 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 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 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 - UpstartMediumData ScientistDesign Algorithm for Longest Substring with K Distinct Characters
This question evaluates proficiency in string-processing and sliding-window algorithm patterns, assessing competency in designing efficient solutions and managing data structures to track distinct elements and reason about time and space complexity.
Coding & AlgorithmsOnsite - UpstartEasyData ScientistImplement factorial and count trailing zeros
This question evaluates understanding of factorial computation and algorithmic techniques, including iterative versus recursive approaches, handling large integers and recursion constraints, and efficient counting of trailing zeros via number-theoretic reasoning.
Coding & AlgorithmsOnsite - VantaMediumSoftware EngineerImplement Adjacent-Line Uniq
Implement a Unix-style adjacent-line deduplication function that groups consecutive identical lines, supports case-insensitive matching, and filters output based on run counts in linear time.
Coding & AlgorithmsOnsitetwo-pointersstringsimulation - VantaEasySoftware EngineerImplement a Unique Lines Command
Implement a streaming generator that mimics the Unix `uniq` command by collapsing consecutive duplicate lines with options for counting and case-insensitivity.
Coding & AlgorithmsOnsiteStreamingString ProcessingFile I/O - VantaMediumSoftware EngineerOrder Classes by Prerequisites with Recursive DFS
Build a deterministic prerequisite ordering with recursive depth-first search. Handle disconnected classes and detect dependency cycles by tracking both active and completed nodes.
Coding & AlgorithmsOnsite - Veeva SystemsMediumSoftware EngineerCompute build order from dependencies
Compute build order from dependencies 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
Uber
Uber Freight
Upstart
Vanta