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 3031–3060 of 3276 results
- 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 - UberMediumFrontend EngineerSimulate a Rank-Based Tournament
This question tests the ability to implement a single-elimination tournament simulation using queue-based structures and demonstrates competency in designing a relational database schema for tournament record-keeping.
Coding & AlgorithmsTechnical ScreenArrayQueueSimulation - UberMediumSoftware EngineerSimulate fixed-shape tiling on a grid
This question evaluates a candidate's ability to implement grid-based simulation and pattern-matching algorithms, including handling fixed-shape placements, internal holes, bounds checking, collision detection, and explicit scanning/tie-breaking rules.
Coding & AlgorithmsOnline Assessment - 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 - UberHardSoftware EngineerSmallest Palindromic Number Strictly Greater Than n, Up to 18 Digits
Given a positive integer of up to 18 digits as a string, return the smallest palindromic number strictly greater than it, or the input itself when no such palindrome stays within 18 digits. Tests digit-level reasoning and edge cases such as palindromic inputs, carries and changes in digit count.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerSolve 12 coding interview problems
This multi-problem set evaluates broad algorithmic problem-solving skills, including bitwise reasoning, sliding-window and frequency analysis, stack/monotonic patterns, graph/DP reasoning with constrained jumps, and tree-path parity techniques.
Coding & AlgorithmsOnline Assessment - 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 Balanced Permutations and Tree Reversals
This two-part prompt evaluates array and permutation reasoning for detecting contiguous value ranges and directed graph/tree reasoning for minimizing edge reversals when choosing a root, testing competencies in index and interval management, graph traversal and orientation, and algorithmic counting.
Coding & AlgorithmsOnline Assessment - UberHardSoftware EngineerSolve Knight and Reversal Problems
This question evaluates graph modeling, state-space exploration, and shortest-path/reachability reasoning for nonstandard movement rules and constrained state transformations.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerSolve Prime Jumps and Pipeline Scaling
This question evaluates algorithmic problem-solving skills in constrained path optimization and resource-allocation throughput maximization, including concepts such as graph modelling with prime-step constraints, dynamic programming, number-theoretic reasoning, and combinatorial optimization.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerSolve Two OA Algorithm Problems
This problem tests your ability to optimize resource allocation using a greedy approach with a priority queue and to determine graph reachability within a constrained network.
Coding & AlgorithmsOnline AssessmentGreedyGraphsBFS - UberHardSoftware EngineerSolve Wonderful Strings and Grid Queries
This problem tests your ability to optimize string transformations using bitmask dynamic programming and to perform efficient range-based queries on a grid using a 2D data structure or sweep-line approach.
Coding & AlgorithmsTechnical ScreenBitmaskDynamic ProgrammingOffline Queries - UberHardSoftware EngineerSolve jump maximization and palindromic path queries
This problem tests dynamic programming with array constraints and tree-based traversal combined with bitwise parity checks for palindromic properties.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingSliding WindowTrees - 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 - UberMediumSoftware EngineerSolve two interview coding problems
These two problems evaluate algorithmic problem-solving skills: the first focuses on spatial reasoning and grid-based distance computation relative to obstacles, while the second targets tree traversal and character-frequency reasoning for ancestor-path palindrome checks.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerSort a Matrix into Snake Order Using Adjacent Swaps
Construct any legal adjacent-swap sequence that sorts a numbered matrix into snake order, prove correctness, validate the output, and discuss reducing swap counts.
Coding & AlgorithmsTechnical Screen - UberEasySoftware EngineerSort a String of Clothing Sizes
This problem tests the ability to perform a custom sort on a constrained set of characters using an O(n) counting approach rather than a standard comparison-based O(n log n) sort.
Coding & AlgorithmsTechnical ScreenSortingCounting SortString Manipulation - UberMediumSoftware EngineerSort by squares and find k-th smallest
This question evaluates array manipulation, ordering by derived keys (squares/absolute values), order-statistics reasoning, and algorithmic complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerTrack Customer Referral Revenue
This problem tests your ability to model a tree structure and maintain aggregated values across subtrees using recursion or iterative tree traversal.
Coding & AlgorithmsTechnical ScreenTreesRecursionDFS - 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 - UiPathMediumMachine Learning EngineerCompute Minimum L-Moves on Infinite Grid
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute Minimum L-Moves on Infinite Grid states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - UiPathMediumSoftware EngineerCompute longest distinct substring, case-insensitive
This question evaluates competency in string processing, character normalization for case-insensitivity, algorithmic complexity analysis, and handling large-scale or streaming inputs.
Coding & AlgorithmsTechnical Screen - UiPathMediumMachine Learning EngineerImplement cocktail shaker sort and analyze
This question evaluates a candidate's understanding of sorting algorithms and algorithmic optimization, specifically implementation and enhancement of cocktail shaker sort, plus analysis of time and space complexity, stability, and counts of comparisons and swaps.
Coding & AlgorithmsTechnical Screen - UiPathMediumMachine Learning EngineerProbability a draw-until-threshold score ends at or below a limit
A coding question on probability: a player repeatedly adds a uniformly random number of points until the total reaches a threshold, and you return the probability that the final total is at most a given limit. It tests careful probabilistic reasoning and an efficient computation for inputs up to ten thousand.
Coding & AlgorithmsTechnical Screen - UpstartEasySoftware EngineerCompute a Point Set's Bounding Rectangle
This problem tests the ability to find the extrema of a coordinate set in a single linear pass to define an axis-aligned bounding box.
Coding & AlgorithmsOnline AssessmentArraysGeometryAlgorithms - UpstartMediumSoftware EngineerCompute buffet revenue with capacity and waiting
This question evaluates event-driven simulation and state-management skills, including handling customer lifecycle, capacity constraints, FIFO queuing behavior, and revenue aggregation.
Coding & AlgorithmsTechnical Screen - UpstartMediumSoftware EngineerCount Words in Lexicographic Order
This problem tests your ability to efficiently process a collection of strings, count their occurrences using a hash map, and output them in a sorted format.
Coding & AlgorithmsOnline AssessmentHash MapSortingStrings - UpstartMediumSoftware EngineerDecode an anagram sentence using vocabulary constraints
This question evaluates string manipulation, anagram detection, and constrained dictionary mapping skills, testing attention to character-level constraints and correct disambiguation among similar vocabulary entries.
Coding & AlgorithmsTechnical Screen
Uber
Uber Freight
UiPath
Upstart