practice a little every day, paws crossed ♡
Software Engineer 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 4111–4140 of 5874 results
- OptiverMediumSoftware EngineerCount nonnegative buy/sell sequences
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.
Coding & AlgorithmsTechnical Screen - OptiverMediumSoftware EngineerCount the Days Between Two Dates
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.
Coding & AlgorithmsOnline Assessment - OptiverMediumSoftware EngineerCourier Drone: Fastest Fixed-Distance Segment From Tick Logs
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.
Coding & AlgorithmsOnline Assessmentprefix-sumsbinary-searchsliding-window - OptiverMediumSoftware EngineerDays Between Two Calendar Dates
This question evaluates proficiency in date and calendar arithmetic, specifically handling varying month lengths, leap year rules, and computing absolute differences between dates.
Coding & AlgorithmsOnline Assessment - OptiverMediumSoftware EngineerDecide and implement DP/heap and approximation
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.
Coding & AlgorithmsTechnical Screen - OptiverMediumSoftware EngineerDemonstrate task switching and memory strategies
This question evaluates task-switching ability, working-memory management, interference control, and error-recovery strategies—core executive functions involved in rapid stimulus–response mappings.
Statistics & MathTechnical Screen - OptiverMediumSoftware EngineerDesign a Balloon Festival Simulator
This question evaluates proficiency in data structures, event-driven simulation, numerical aggregation of spatially varying fields, and time-based state tracking for mutable entities.
Coding & AlgorithmsOnline Assessment - OptiverMediumSoftware EngineerDesign a Multi-Level Expiring Item Store
Design an in-memory multi-level key-value store where items are stored at specific priority levels with individual expiration timestamps, supporting query fallback and expiration cleanup.
Software Engineering FundamentalsOnline AssessmentData StructuresDesignHash Table - OptiverHardSoftware EngineerDesign a News Subscription Processing Engine
Design and implement an in-memory news subscription processing engine that supports attribute-based filtering, deduplication, unsubscription, and unacknowledged delivery tracking.
Software Engineering FundamentalsOnline AssessmentLow-Level DesignPub-SubConcurrency - OptiverMediumSoftware EngineerDesign a balloon stability tracker
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.
Coding & AlgorithmsOnline Assessment - OptiverMediumSoftware EngineerDesign a circular queue data structure
This problem tests your ability to implement a fixed-capacity circular queue using a static array, focusing on efficient pointer arithmetic and state management.
Coding & AlgorithmsTechnical ScreenData StructuresArraysQueues - OptiverMediumSoftware EngineerDesign a queue and analyze tradeoffs
This question evaluates understanding of FIFO data structures, algorithmic complexity analysis, memory and cache behavior, and concurrent access concerns.
Coding & AlgorithmsTechnical Screen - OptiverMediumSoftware EngineerDesign a satellite propagation simulator
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.
Coding & AlgorithmsOnline Assessment - OptiverHardSoftware EngineerDesign a subscription push service
Design a subscription push service evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
System DesignTechnical Screen - OptiverHardSoftware EngineerDesign a topic-based news subscription system
This question evaluates system design skills for building a topic-based news subscription service, focusing on streaming ingestion, relevance filtering, sliding-window rate limiting, de-duplication, ordered delivery, and data structure choices for in-memory operation.
System DesignOnline Assessment - OptiverMediumSoftware EngineerDesign an object-oriented queue and compare implementations
Design an object-oriented queue and compare implementations evaluates engineering fundamentals, trade-offs, examples, pitfalls, and operational implications in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Software Engineering FundamentalsTechnical Screen - OptiverHardSoftware EngineerDesign and backtest a trading strategy
This question evaluates a candidate's ability to design and rigorously evaluate a minute-level mean-reversion trading strategy, encompassing quantitative finance competencies such as signal construction, risk controls, position sizing, transaction-cost modeling, reproducible backtesting, and statistical validation; it belongs to the Analytics & Experimentation category within financial time-series and backtesting. It is commonly asked because it tests both practical implementation skills (reproducible backtests and walk-forward validation) and conceptual understanding (overfitting, data-snooping, and statistical significance testing), requiring a mix of practical application and conceptual statistical reasoning.
Analytics & ExperimentationTechnical Screen - OptiverHardSoftware EngineerDesign low-latency trading infrastructure
Design an end-to-end low-latency market making and execution architecture split between an exchange-colocated environment and a remote operational office.
System DesignOnsiteLow LatencyHigh-Frequency TradingNetworking - OptiverHardSoftware EngineerDetect Currency Arbitrage After a Cycle Fee
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.
Coding & AlgorithmsTechnical Screen - OptiverMediumSoftware EngineerDetect currency arbitrage with costs
This question evaluates a candidate's competency in algorithmic problem modeling, graph-based cycle detection, and numerical reasoning about exchange rates and transaction costs.
Coding & AlgorithmsTechnical Screen - OptiverMediumSoftware EngineerEstimate expected comparisons in a BST
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.
Coding & AlgorithmsOnline Assessment - OptiverMediumSoftware EngineerFastest 1000 Meters: Max Average Speed from 5-Second Distance Splits
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.
Coding & AlgorithmsOnline Assessment - OptiverMediumSoftware EngineerFastest 500-Unit Stretch on a Conveyor Belt From Tick Logs
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.
Coding & AlgorithmsOnline Assessmentsliding-windowtwo-pointersinterpolation - OptiverMediumSoftware EngineerFastest Rolling One-Kilometer Average Speed from 5-Second Distance Samples
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.
Coding & AlgorithmsOnline Assessment - OptiverHardSoftware EngineerFind the Color Probability After Discarding Cards
This problem tests your understanding of conditional probability, combinatorics, and how dependent events (sampling without replacement) impact statistical expectations.
Statistics & MathTechnical ScreenProbabilityCombinatoricsStatistics - OptiverHardSoftware EngineerFind the Probability That the Three Smallest Dice Sum to Three
This problem tests combinatorics and probability theory by requiring the derivation of the exact probability that the three smallest values of four independent dice rolls sum to exactly three.
Statistics & MathTechnical ScreenProbabilityCombinatoricsStatistics - OptiverMediumSoftware EngineerIdentify OS component causing process starvation
This question evaluates understanding of process scheduling, kernel-level resource allocation, and starvation-related concurrency issues within the operating systems domain.
Coding & AlgorithmsOnline Assessment - OptiverHardSoftware EngineerImplement Expiration-Aware Retrieval Across Storage Levels
Design and implement a multi-level storage system that purges expired items, filters for under-utilized storage tiers, and deterministically retrieves the highest-weight item.
Software Engineering FundamentalsHR ScreenData StructuresDesignHeap - OptiverHardSoftware EngineerImplement a Multicore Overheat Prevention Controller
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.
Coding & AlgorithmsOnline Assessment - OptiverMediumSoftware EngineerImplement price-based order matcher
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.
Coding & AlgorithmsOnline Assessment
Optiver