Coding & Algorithms interview questions

Showing 3001–3030 of 3276 results

• Implement 2D word search variants and analyze complexityMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Cache Eviction And Seat AssignmentMedium

  This problem tests your ability to combine a Least Recently Used (LRU) cache mechanism with a greedy strategy for geometric optimization in seat assignments.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Implement FizzBuzzMedium

  This problem tests foundational programming skills by requiring the implementation of conditional logic and string manipulation based on modular arithmetic patterns.

  UberData ScientistCoding & AlgorithmsOnsite
• Implement Last-Click Attribution APIsMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Minesweeper and Word SearchMedium

  This problem tests your ability to manipulate 2D grids using BFS/DFS for board traversal and randomized state generation.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Implement Store AutocompleteMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Referral Revenue TrackerMedium

  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.

  UberMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement binary search from scratchMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Implement rate limiter, top-K, scheduler algorithmsMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Implement three interview-style coding tasksHard

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Implement uniform sampling in squaresMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Implement weighted sampling without replacementMedium

  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.

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Kth Employee Reached in an Ordered HierarchyMedium

  This problem tests tree traversal techniques, specifically finding the k-th node in an in-order traversal of a binary search tree while handling dynamic updates or specific subtree constraints.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Last Truck to Leave a One-Dimensional LaneMedium

  Determine the time and ID of the last truck to exit a one-dimensional lane where trucks travel at constant speed and reverse directions upon colliding.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maintain the First Value That Appears Exactly OnceHard

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize Minimum Scaled ValueHard

  This problem tests your ability to use binary search on the answer space to solve a constrained resource allocation problem effectively.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize Throughput and Count Trigger ComponentsMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize stock profit with one or two tradesHard

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Maximize the Eligible Carpool GroupMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Maximum Score with Prime JumpsHard

  This problem tests dynamic programming and number theory, specifically the ability to combine linear path traversal with jump-based transitions constrained by prime number properties.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimum Delivery Cost Between CitiesMedium

  This problem tests your ability to optimize pathfinding costs in a graph where edge weights are determined by a combination of absolute differences and conditional local minimums.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Move zeros to frontMedium

  This problem tests your ability to manipulate array indices in-place to reorder elements according to a specific condition while maintaining relative stability.

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Parse and evaluate nested expressions with validationMedium

  This question evaluates a developer's ability to design and implement a robust parser and evaluator for a parenthesized expression language, testing parsing, lexical scoping and variable binding, operator semantics, error detection, and safe integer arithmetic.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Print directory tree with indentationMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Produce a valid deployment orderMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Quadtree for 2D Geospatial PointsMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Reconstruct the Alphabet Order of an Alien LanguageMedium

  This question tests the ability to model partial ordering constraints using a directed graph and perform a topological sort to deduce a valid sequence.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Replace Dashes With Nearest LettersMedium

  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.

  UberBackend EngineerCoding & AlgorithmsTechnical Screen
• Return a Package Build OrderMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return the Earliest ID Seen Exactly OnceMedium

  Maintain the earliest single-visit ID with counts and queue pruning, handling permanent duplicates, empty results, and strict versus amortized constant-time queries.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen