Coding & Algorithms interview questions

Showing 2131–2160 of 3276 results

• Calculate Days Between Arbitrary Gregorian DatesMedium

  This problem tests the ability to implement a calendar-based calculation algorithm, specifically handling leap year logic and modular arithmetic without iterating through every day.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Cargo Order Allocation Across Departing PlanesHard

  This question evaluates competence in deterministic resource allocation, stateful simulation, and capacity-management under time constraints, exercising algorithmic reasoning and data-structure handling within the Coding & Algorithms domain.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare common data structures and usesMedium

  Compare common data structures and uses 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.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare two programs for equivalenceMedium

  This question evaluates program-equivalence reasoning skills, including understanding of language semantics (mutation, ordering stability, integer overflow/underflow, integer-division behavior), competency in comparing time and space complexity, and the ability to design property-based tests and edge cases.

  OptiverQuantitative TraderCoding & AlgorithmsOnline Assessment
• Count nonnegative buy/sell sequencesMedium

  This question evaluates combinatorial reasoning and algorithmic analysis by asking for the count of constrained buy/sell sequences, testing competence in counting under constraints and reasoning about sequence invariants.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count the Days Between Two DatesMedium

  This question evaluates date arithmetic, calendar logic, string parsing, and correct leap-year handling as implementation competencies. It is commonly asked to assess algorithmic correctness and edge-case handling across month, year, and leap boundaries, falls under the Coding & Algorithms domain (date/calendar problems), and targets practical application rather than purely conceptual understanding.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Courier Drone: Fastest Fixed-Distance Segment From Tick LogsMedium

  From per-tick distance logs, find the highest average speed over any time span that covers exactly a target distance, where spans may start and end partway through a tick. Tests prefix sums, linear interpolation, and showing that an optimal span touches a tick boundary.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Days Between Two Calendar DatesMedium

  This question evaluates proficiency in date and calendar arithmetic, specifically handling varying month lengths, leap year rules, and computing absolute differences between dates.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Decide and implement DP/heap and approximationMedium

  This question evaluates dynamic programming for counting constrained subsequences, priority-heap implementation and API robustness for job scheduling, and heuristic approximation methods for NP-hard selection problems, along with algorithmic complexity analysis.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a Balloon Festival SimulatorMedium

  This question evaluates proficiency in data structures, event-driven simulation, numerical aggregation of spatially varying fields, and time-based state tracking for mutable entities.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Design a balloon stability trackerMedium

  This question evaluates event-driven simulation, time-ordered state management, floating-point numerical evaluation of aggregate functions, and data-structure design for tracking dynamic object states and stability thresholds; it falls under the Coding & Algorithms domain, specifically simulation, event processing, and algorithmic data structures.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Design a circular queue data structureMedium

  This problem tests your ability to implement a fixed-capacity circular queue using a static array, focusing on efficient pointer arithmetic and state management.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a queue and analyze tradeoffsMedium

  This question evaluates understanding of FIFO data structures, algorithmic complexity analysis, memory and cache behavior, and concurrent access concerns.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a satellite propagation simulatorMedium

  Optiver software-engineer take-home: implement a SatelliteNetwork that simulates timed message propagation over an undirected graph and fires OnSatelliteReportedBack callbacks in deterministic order. It tests graph modeling, discrete-event simulation, priority-queue scheduling, and careful handling of 10s-per-hop forwarding and 30s report timing with tie-breaking by SatelliteId.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Detect Currency Arbitrage After a Cycle FeeHard

  You are given a matrix of positive currency exchange rates, where rates[i][j] units of currency j are received for one unit of currency i. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Detect currency arbitrage with costsMedium

  This question evaluates a candidate's competency in algorithmic problem modeling, graph-based cycle detection, and numerical reasoning about exchange rates and transaction costs.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Devise sequence-rule detection strategyMedium

  This question evaluates pattern-recognition, algorithm design, statistical reasoning, and model-selection skills required for sequence inference and candidate-term prediction in the Coding & Algorithms / Data Science domain.

  OptiverQuantitative TraderCoding & AlgorithmsOnline Assessment
• Estimate expected comparisons in a BSTMedium

  Estimate expected comparisons in a BST 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.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Fastest 1000 Meters: Max Average Speed from 5-Second Distance SplitsMedium

  Given the meters a runner covers in each consecutive 5-second interval, find the highest average speed over any continuous stretch of exactly 1000 meters, where stretches may start or end mid-interval. Tests sliding-window reasoning, linear interpolation at boundaries and edge cases such as one interval exceeding 1000 meters.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Fastest 500-Unit Stretch on a Conveyor Belt From Tick LogsMedium

  Given how many units of material a conveyor belt moves during each fixed-length tick, find the maximum average speed over any continuous time stretch covering exactly 500 units, where the stretch may start or end mid-tick.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Fastest Rolling One-Kilometer Average Speed from 5-Second Distance SamplesMedium

  Given the meters a runner covers in each 5-second interval, find the fastest average speed over a rolling one-kilometer stretch, defined as the shortest run of intervals ending at each point that covers at least 1000 meters. It tests sliding-window reasoning over large arrays and precise window definitions.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find missing numbers in sequencesHard

  This problem tests pattern recognition and algorithm design for identifying missing terms in a sequence that may follow arithmetic, geometric, polynomial, or linear recurrence rules.

  OptiverData ScientistCoding & AlgorithmsOnline Assessment
• Identify OS component causing process starvationMedium

  This question evaluates understanding of process scheduling, kernel-level resource allocation, and starvation-related concurrency issues within the operating systems domain.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement a Multicore Overheat Prevention ControllerHard

  Simulate a multicore thermal controller with delayed workload changes, shared passive cooling, vibration-sensitive active cooling, shutdown and restart thresholds, and transition-only tick output.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement price-based order matcherMedium

  This question evaluates competency in data structures and algorithmic design for price-based order matching systems, including priority-based matching, efficient order book maintenance, and deterministic tie-breaking requirements.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maintain Price Levels For A Single-Symbol Order BookMedium

  Design and implement a single-symbol limit order book that tracks individual orders and aggregates quantity by price level, supporting order additions, modifications, cancellations, and best price queries.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Make Two Apple Piles Equal With Doubling MovesMedium

  This question evaluates algorithmic problem-solving and discrete-mathematics competencies, focusing on reasoning about state transitions, invariants, and number-theoretic constraints within the Coding & Algorithms domain for data scientist roles.

  OptiverData ScientistCoding & AlgorithmsTechnical Screen
• Match alphanumeric patterns in a streamMedium

  This question evaluates skills in exact and approximate alphanumeric string matching, streaming pattern lookup, noise-tolerant comparison, and performance-oriented data structures and encodings.

  OptiverData ScientistCoding & AlgorithmsOnline Assessment
• Minimize moves to transform floor layoutsMedium

  This question evaluates algorithm design and combinatorial optimization skills, focusing on reasoning about minimal moves, greedy heuristics, and proving optimality within the Coding & Algorithms domain for data-science technical roles.

  OptiverData ScientistCoding & AlgorithmsOnline Assessment
• Optimize switching puzzle solutionMedium

  This question evaluates the ability to model a Lights Out-style grid puzzle as a linear system over GF(2), linear algebra skills (Gaussian elimination and null-space reasoning), and combinatorial optimization for minimizing toggle moves.

  OptiverQuantitative TraderCoding & AlgorithmsOnline Assessment