Coding & Algorithms interview questions

Showing 2911–2940 of 3276 results

• Assign 2n Workers to Two Tasks to Minimize Total TimeHard

  This question evaluates algorithmic problem-solving skills in combinatorial optimization and resource allocation, focusing on reasoning about cost differences when assigning 2n workers into two equal-sized tasks and belongs to the Coding & Algorithms domain.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen
• Autoscale a Server Fleet from Throughput ReadingsMedium

  This question evaluates algorithmic implementation skills and numeric reasoning, focusing on stateful simulation of autoscaling behavior and capacity arithmetic under streaming throughput readings.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Piecewise Linear InterpolationMedium

  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.

  Two SigmaData ScientistCoding & AlgorithmsOnline Assessment
• Compute maximum currency exchange rateHard

  Compute maximum currency exchange rate 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.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Distinct Island Shapes in a Binary GridHard

  This question evaluates a candidate's understanding of grid-based connected components and spatial equivalence, measuring competency in representing and distinguishing island shapes regardless of their location.

  Two SigmaData ScientistCoding & AlgorithmsOnsite
• Evaluate Piecewise Linear FunctionMedium

  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.

  Two SigmaData ScientistCoding & AlgorithmsOnline Assessment
• Evaluate a Piecewise Linear FunctionMedium

  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.

  Two SigmaData ScientistCoding & AlgorithmsOnline Assessment
• Evaluate piecewise linear function at xMedium

  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.

  Two SigmaData ScientistCoding & AlgorithmsOnline Assessment
• Expected Number of Good Pairs in a Randomly Weighted Complete GraphHard

  This question evaluates probabilistic reasoning, combinatorics, and order-statistics intuition by asking for the expected count of mutual maximum-edge neighbors (good pairs) in an edge-weighted complete graph with i.i.d. continuous weights.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen
• Fill Missing Time-Series Values with Linear Interpolation (Duplicate Timestamps Allowed)Easy

  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.

  Two SigmaData ScientistCoding & AlgorithmsOnline Assessment
• Implement Price-Time Order MatchingMedium

  Design and implement an in-memory limit order book matching engine supporting buy and sell orders with price-time priority (FIFO) and order cancellation.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Univariate Linear Regression with Ordinary Least SquaresHard

  This question evaluates understanding of univariate linear regression and the ordinary least squares (OLS) closed-form estimator, probing competencies in basic statistical estimation, interpretation of slope and intercept, numerical stability, and floating-point arithmetic.

  Two SigmaData ScientistCoding & AlgorithmsOnsite
• Implement a Hash Map with Separate Chaining and ResizingMedium

  This question evaluates understanding of hash table fundamentals, including hashing, separate chaining collision resolution, linked-list bucket management, dynamic resizing, and rehashing to maintain load factor and amortized performance.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an In-Memory DatabaseHard

  This question evaluates competence in implementing in-memory relational data structures, parsing tokenized database-like commands, and evaluating compound predicates with comparison operators.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement binary encode/decode with frequency treeHard

  This question evaluates understanding of frequency-based binary encoding and decoding, including deterministic tree construction, tie-breaking rules, and traversal, and tests knowledge of trees, priority queues, greedy algorithms, and bit-level string manipulation in the Coding & Algorithms domain.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement merge sort and largest 1-rectangleMedium

  This question evaluates proficiency in implementing and analyzing classic algorithms, specifically merge sort for array sorting and techniques for computing the largest all-ones rectangular submatrix in a binary matrix, testing algorithmic thinking, data structure manipulation, and time/space complexity reasoning.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen
• Linear Interpolator with ExtrapolationMedium

  This question evaluates understanding of piecewise linear interpolation and extrapolation, numerical robustness with floating-point values, and algorithmic competencies such as sorting and efficient query location for large datasets.

  Two SigmaQuantitative ResearcherCoding & AlgorithmsTechnical Screen
• Match Limit Orders with Price-Time PriorityMedium

  Implement a limit order matching engine adhering to price-time priority (FIFO), resting-order execution pricing, and partial fill mechanics.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Match readings with latest same-city humidityEasy

  This question evaluates the ability to align and join time-ordered sensor data by key, testing skills in time-series merging, per-key state management, and handling absent matches.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen
• Maximize Capital by Completing at Most k ProjectsMedium

  This question evaluates algorithmic problem-solving and optimization skills within the Coding & Algorithms domain, focusing on selection under resource and operation constraints and reasoning about time and space complexity.

  Two SigmaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximum-Product Simple Path in a Complete Directed GraphHard

  This question evaluates skills in graph algorithms, multiplicative path optimization, and combinatorial dynamic programming, testing competency in reasoning about simple paths and product-based scoring in directed weighted graphs.

  Two SigmaData ScientistCoding & AlgorithmsOnsite
• Merge Two Sorted ListsHard

  This problem tests your ability to manipulate linked list pointers to merge two sorted sequences efficiently without allocating extra space for new nodes.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen
• Merge two sorted linked listsHard

  This problem tests your ability to manipulate linked list pointers to merge two sorted structures in-place, focusing on space optimization and handling edge cases.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen
• Return sorted values after quadratic transformMedium

  This problem tests your ability to efficiently transform elements in a sorted array using a quadratic function and merge them back into a single sorted array in linear time.

  Two SigmaData ScientistCoding & AlgorithmsTechnical Screen
• Solve capital selection and grid escapeMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve capital selection and grid escape states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  Two SigmaSoftware EngineerCoding & AlgorithmsOnsite
• Solve tree partition and IPO allocationMedium

  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.

  Two SigmaMachine Learning EngineerCoding & AlgorithmsOnline Assessment
• Analyze sales with groupbyEasy

  This question evaluates proficiency in data manipulation and analytics using pandas, specifically the ability to join relational tables and apply groupby aggregations to compute business metrics like total sales, average sales per order, and completion rates.

  UberMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Answer Repeated Shortest Increasing-Path QueriesHard

  Preprocess shortest strictly increasing grid paths for repeated target queries, with deterministic BFS ties, predecessor reconstruction, and memory trade-offs.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Assign Meetings to the Minimum Number of RoomsMedium

  Assign meetings to the minimum number of rooms using deterministic room ID allocation, returning the room assigned to each meeting in original input order.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Bracket substrings matching any patternMedium

  This problem tests your ability to efficiently match and replace substrings based on a set of predefined patterns, prioritizing matches based on position and length.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen