Coding & Algorithms interview questions

Showing 2971–3000 of 3276 results

• Determine balanced k values in a permutationMedium

  This question evaluates algorithmic reasoning about permutations and contiguous subarray properties, testing skills in array manipulation, positional reasoning, combinatorial insight, and complexity-aware algorithm design within the Coding & Algorithms domain.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Evaluate an Arithmetic ExpressionMedium

  This problem tests your ability to parse and evaluate mathematical expressions involving integers, addition, subtraction, multiplication, division, and parentheses using stacks or recursion.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find Any Available Meeting RoomMedium

  This question evaluates a candidate's competence in handling interval-based scheduling problems, specifically managing interval data and performing efficient searches within sorted bookings to detect potential overlaps.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find Earliest Column With OneEasy

  This question tests the ability to optimize searches in a sorted binary matrix by minimizing expensive API calls through efficient traversal techniques.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Earliest Full Connectivity TimestampMedium

  This question evaluates understanding of graph connectivity and temporal event processing, examining how pairwise interactions over time can merge components into a single connected set.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Kth Smallest in BSTMedium

  This question evaluates understanding of binary search tree properties, ordered data retrieval, and algorithmic efficiency in locating the k-th smallest element.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Robots by Nearest-Blocker DistancesHard

  Implement an algorithm to identify all robots in a grid whose four-directional distances to the nearest obstacle or grid boundary match a target query.

  UberMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find a Black-Box Convex Function MinimumMedium

  This question evaluates proficiency in zero-order optimization and algorithm design, focusing on reasoning about convexity and unimodality when only function evaluations are available.

  UberMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find a Bounded Subarray and Largest SquareMedium

  This question evaluates array manipulation and algorithmic problem-solving skills across two tasks: enforcing bounded value ranges within contiguous subarrays and identifying largest uniform square regions in binary matrices, exercising concepts such as range-tracking, efficient data structures, and dynamic programming.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find a Lexicographically Optimal Robot Path with Charging CellsMedium

  Find a path in a grid from start to target that lexicographically minimizes charging stations used, peak battery segment length, total moves, and breaks ties by flattened cell indices.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find all dictionary words in a gridMedium

  This problem tests your ability to navigate a 2D grid using backtracking and optimize dictionary lookups using a Trie data structure.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find cheapest flight with at most K stopsHard

  This question evaluates graph algorithm proficiency and problem-modeling skills, specifically working with directed weighted graphs to optimize path cost under a constraint on intermediate stops.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find earliest common meeting slotMedium

  This problem tests interval management and the ability to find a common free window across multiple disjoint sets of busy times while respecting daily working constraints.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find earliest time all riders become connectedHard

  Assesses understanding of graph connectivity, temporal event processing, and dynamic graph data-structures for determining when a set of nodes becomes a single connected component.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find leftmost point of maximum brightnessMedium

  This question evaluates understanding of interval overlap counting, efficient use of ordered data structures for range events, tie-breaking logic, and robustness to numeric edge cases such as large coordinates and floating-point radii.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum activations to absorb all ballsMedium

  This question evaluates the ability to model Euclidean-distance relations as a static connectivity graph and reason about the minimum number of activations needed to absorb all nodes, testing computational geometry and graph algorithms competency.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum reversals to orient edges away from rootMedium

  This question evaluates understanding of directed graphs and rooted trees, the ability to reason about edge orientations and minimal reversals, and competency in traversal techniques and complexity analysis.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find next and closest palindromesMedium

  This question evaluates string-based numeric manipulation and palindrome construction, including edge-case handling (all 9s, single-digit inputs, length changes), candidate generation and magnitude comparison of large numbers as strings, and carry propagation for fixed-length decimal palindromes.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find robots in a grid whose four-direction distances to blockers match a queryMedium

  Given a grid of robots, blockers and empty cells plus a query of four distances, return every robot whose distances to the nearest blocker or grid edge going up, down, left and right match the query exactly. Tests precise distance definitions, boundary handling and scaling past a per-robot scan.

  UberMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find robots matching obstacle-distance signatureHard

  This problem tests spatial reasoning, multi-source Breadth-First Search (BFS) for distance mapping, and pattern matching within 2D grids.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find shortest jumps in circular arrayMedium

  This question evaluates graph-traversal and modular arithmetic skills by requiring modeling a circular array as a state graph and determining reachability and minimum-distance jumps under wrap-around constraints.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find smallest start index avoiding left exitEasy

  This question evaluates a candidate's ability to analyze reachability and cycle behavior in array-based functional graphs, testing competency in array manipulation, traversal, loop detection, and runtime optimization within the Coding & Algorithms domain.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the Best Currency Conversion RateMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Cheapest Valid Round TripMedium

  Find the cheapest round-trip flight pair satisfying a minimum stay duration constraint in linear time with deterministic tie-breaking.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the First Unique LogMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the K Closest Points to a Query LocationMedium

  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.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the Next Larger PalindromeMedium

  This question evaluates proficiency in numeric and string manipulation, algorithmic thinking, and edge-case reasoning related to palindromic number generation.

  UberData ScientistCoding & AlgorithmsOnsite
• Group AnagramsMedium

  This problem tests your ability to identify and implement an efficient grouping mechanism using hash maps to categorize strings by a common canonical form.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Group strings that are anagramsMedium

  This problem tests your ability to efficiently group strings by their character composition using hash maps or sorting techniques.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Handle invalid Lisp expression parsingMedium

  This question evaluates the ability to parse and evaluate nested Lisp-like expressions, manage variable bindings and scope resolution, and detect malformed input and syntax errors.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment