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 361–390 of 427 results
- TripadvisorMediumSoftware EngineerBuild blog UI with API data and likes
This question evaluates front-end JavaScript competencies including UI rendering, client-side state management, asynchronous REST API integration, loading and error handling, and resolving author identity relative to the current user.
Coding & AlgorithmsOnline Assessment - Two SigmaMediumData ScientistCompute Piecewise Linear Interpolation
This question evaluates skills in algorithm design and numerical interpolation, including sorting and searching among 2D points, handling boundary cases for extrapolation, and computing linear interpolation accurately and efficiently.
Coding & AlgorithmsOnline Assessment - Two SigmaMediumData ScientistEvaluate Piecewise Linear Function
This question tests the ability to efficiently search through sorted interval data and apply linear interpolation to compute the value of a continuous piecewise function at a specific input point.
Coding & AlgorithmsOnline AssessmentBinary SearchInterpolationData Structures - Two SigmaMediumData ScientistEvaluate a Piecewise Linear Function
This question tests the ability to efficiently search through a sorted collection of coordinates and apply linear interpolation to compute values for a continuous piecewise function.
Coding & AlgorithmsOnline AssessmentBinary SearchInterpolationGeometry - Two SigmaMediumData ScientistEvaluate piecewise linear function at x
This question evaluates competency in numerical interpolation and handling of piecewise linear functions, including locating the correct segment in a sorted sequence of points and managing out-of-range inputs.
Coding & AlgorithmsOnline Assessment - Two SigmaEasyData ScientistFill Missing Time-Series Values with Linear Interpolation (Duplicate Timestamps Allowed)
This question evaluates a candidate's ability to perform time-series data cleaning and aggregation of duplicate timestamps, plus numerical linear interpolation and boundary value propagation, within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - Two SigmaMediumMachine Learning EngineerSolve tree partition and IPO allocation
This question evaluates algorithmic problem-solving skills in tree processing and allocation simulations, specifically assessing understanding of subtree-sum computation for tree partitioning and deterministic round-robin allocation logic for IPO-style share distribution, along with appropriate data structure selection and correctness under edge cases. It is commonly asked in the Coding & Algorithms domain because it measures practical application-level implementation and the ability to analyze time and space complexity rather than purely conceptual proof.
Coding & AlgorithmsOnline Assessment - UberHardSoftware EngineerCheck if each prefix forms 1..k permutation
This question evaluates algorithmic thinking and understanding of permutations and prefix invariants, measuring the ability to recognize when the first k elements of a permutation can form the set {1..k}.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCompute final prices with next smaller discount
This question evaluates array-processing and algorithmic problem-solving skills, focusing on reasoning about subsequent elements to compute element-wise discounts under input constraints.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCompute sums and maximum path in a tree
This problem tests your ability to perform post-order tree traversals to calculate subtree metrics and solve optimization problems involving paths that can span across parent-child boundaries.
Coding & AlgorithmsOnline AssessmentTreesRecursionDFS - UberHardSoftware EngineerCount Palindromic Ancestor Paths
This problem tests your ability to use bit manipulation and prefix properties on trees to solve path-related queries efficiently, specifically focusing on the property that a set of characters can form a palindrome if at most one character has an odd frequency.
Coding & AlgorithmsOnline AssessmentBit ManipulationTreesDFS - UberMediumSoftware EngineerCount paths with prime-ending jumps
This question evaluates a candidate's ability to design and implement dynamic programming for counting paths, combining combinatorial reasoning with modular arithmetic and handling step-size constraints tied to primes ending in digit 3.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCount subarrays with at least k fruit pairs
This question evaluates algorithmic problem-solving focused on frequency-based counting and efficient enumeration of subarrays, testing competence in designing subquadratic solutions and selecting appropriate data representations within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCount subarrays with ≥k identical pairs
This question evaluates proficiency in array algorithms, frequency-based counting and combinatorial reasoning for identifying equal-element pairs within contiguous subarrays.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerDetermine balanced k values in a permutation
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerFind leftmost point of maximum brightness
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerFind minimum activations to absorb all balls
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerFind minimum reversals to orient edges away from root
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerFind next and closest palindromes
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerHandle invalid Lisp expression parsing
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerKth Employee Reached in an Ordered Hierarchy
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.
Coding & AlgorithmsOnline AssessmentTreesBinary Search TreeTraversal - UberMediumSoftware EngineerLast Truck to Leave a One-Dimensional Lane
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.
Coding & AlgorithmsOnline AssessmentArraysSortingBrainteaser - UberHardSoftware EngineerMaximize Minimum Scaled Value
This problem tests your ability to use binary search on the answer space to solve a constrained resource allocation problem effectively.
Coding & AlgorithmsOnline AssessmentBinary SearchGreedyOptimization - UberHardSoftware EngineerMaximum Score with Prime Jumps
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.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingPrime NumbersGraph Traversal - UberMediumSoftware EngineerMinimum Delivery Cost Between Cities
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.
Coding & AlgorithmsOnline AssessmentGraphsShortest PathGreedy - UberMediumSoftware EngineerParse and evaluate nested expressions with validation
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.
Coding & AlgorithmsOnline Assessment - 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 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 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
Two Sigma
Uber