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 1561–1590 of 1706 results
- 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 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 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 - 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 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 weighted sampling without replacement
This question evaluates a candidate's ability to design numerically stable, streaming weighted-sampling methods and tests competencies in randomized algorithms, probability, numerical analysis, and memory/time trade-offs.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerMaintain the First Value That Appears Exactly Once
Practice a Uber coding interview problem focused on maintain the first value that appears exactly once. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerMaximize Throughput and Count Trigger Components
This problem tests your ability to optimize resource allocation using a greedy strategy and to identify connected components in a grid-based graph using traversal techniques.
Coding & AlgorithmsTechnical ScreenGreedyGraphsBFS/DFS - UberMediumData ScientistMove zeros to front
This problem tests your ability to manipulate array indices in-place to reorder elements according to a specific condition while maintaining relative stability.
Coding & AlgorithmsTechnical ScreenArraysTwo-PointersIn-place - UberMediumSoftware EngineerPrint directory tree with indentation
This question evaluates proficiency with representing and traversing hierarchical directory trees and producing depth-based formatted output, testing concepts such as tree traversal, recursion or iterative depth tracking, and string formatting for indentation.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerProduce a valid deployment order
This question evaluates proficiency in graph algorithms and dependency resolution, including concepts such as topological ordering, cycle detection, and complexity analysis, plus systems-level reasoning about service deployment dependencies.
Coding & AlgorithmsTechnical Screen - UberMediumBackend EngineerReplace Dashes With Nearest Letters
This problem tests your ability to perform a multi-source shortest path search on a grid to determine the influence of characters on empty spaces, using Manhattan distance and lexicographical tie-breaking.
Coding & AlgorithmsTechnical ScreenBFSGridGraph - UberMediumSoftware EngineerReturn a Package Build Order
This question evaluates a candidate's skills in dependency resolution, graph traversal and cycle detection while reasoning about an externally discovered dependency subgraph and ordering constraints.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerReturn the Earliest ID Seen Exactly Once
Maintain the earliest single-visit ID with counts and queue pruning, handling permanent duplicates, empty results, and strict versus amortized constant-time queries.
Coding & AlgorithmsTechnical Screen - 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 - 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 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 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 - 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 - 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 - 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 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 - UpstartMediumSoftware EngineerFind max word letter span
This question evaluates proficiency in string processing, character mapping, and algorithmic analysis by requiring computation of per-word letter spans while accounting for case normalization, punctuation handling, ties, duplicates, and edge-case word forms.
Coding & AlgorithmsTechnical Screen
Uber
UiPath
Upstart