Optiver Online Assessment Questions

12+ real Optiver OA questions from candidate reports. Sourced from 1Point3Acres, Blind, Glassdoor, Reddit, and LeetCode. Browse by year to find the most recent data, or view the full OA question set filtered on the main company page.

Browse Optiver OA by Year

Recent Optiver OA Sample Questions

Optiver Quantitative Finance Internship Online Test: First Round Coding Questions

coding other 2026 1p3a

3 coding questions, 1.5 hours The following content requires a score higher than 200. You can already view it. Q1: Given n, k, m; n is the number of shares you want to hold, k is the number of shares

View

Optiver Online Test: Coding Challenge on News Subscription Management

easy coding other 2025 1p3a

The OA (Online Response Assessment) for Optimizer has three parts. Here's a sample coding question from the first part. A friend of mine also applied and encountered a question similar to the hot air

View

Optiver 2026 Quant Research Intern PhD Online Assessment Overview

probability stats 2025 1p3a

This post was last edited by 梦见那头独角兽 on 2025-10-7 at 11:42. I applied to Optiver 2026 QR intern, PhD track. The first round of online assessment (OA) was the infamous 90-second probability questions,

View

Optiver - SDE OA

easy coding other 2025 leetcode

A satellite network is experimenting with a distributed communication protocol based on satellite connections. During system tests, the team wants to ensure that messages they sent are processed in the correct...

View

Optiver Behavioral Phone Call

behavioral 2025 reddit

Hey! I just received an email for a 25-minute behavioral phone call from Optiver after completing my OA last week. This is my first interview and I am not sure what to expect. I assume it will mainly

View

Incomplete question in Optive coding OA

coding other 2024 reddit

I received my Optiver OA assessment link last week, which contains three sections (in this post, I just want to talk about the coding part). The coding section consists of two questions (mostly OOP) w

View

Optiver | OA | Truck Positions

arrays 2023 leetcode

Truck Positions A logistics company has a central software solution to track the position of their trucks. Different applications are interested in different trucks. To save bandwidth the company wants to...

View

Optiver | OA | Concert Tickets

easy greedy 2023 leetcode

The OA was for Software Engineer Internship 2024 and below is the second question from it. # Concert Tickets ## Problem Statement As a long time live-music fan you have kept a bucket...

View

Optiver OA [ Hard ] @leetcode_dafu and @cpcs

easy coding other 2023 leetcode

The OA was for Software Engineer Internship 2024 and below is the second question from it. Concert Tickets Problem Statement As a long time live-music fan you have kept a bucket list of...

View

Optiver Graduate SWE 2025 OA Q1: Fast Modular Arithmetic Under Constraints

coding other interviewdb

## Problem You are given two integers `a` and `b` and a prime modulus `p`. Compute `(a^b) mod p` efficiently. Then: given an array of `n` integers, compute the product of all elements modulo `p`, but skip any element that is divisible by `p`. ```cpp long long mod_exp(long long base, long long exp, long long mod); long long filtered_product(vector<long long>& arr, long long p); ``` **Example:** ``` mod_exp(2, 10, 1000000007) -> 1024 filtered_product([2, 3, 7, 14, 5], 7) skip 7 and 14 (divisible by 7) -> (2 * 3 * 5) % 7 = 30 % 7 = 2 ``` ## Follow-ups 1. What is the time complexity of fast exponentiation? How does it compare to naive exponentiation for b = 10^18? 2. By Fermat's little theorem, what is `a^(p-1) mod p` when p is prime and gcd(a,p)=1? How can this simplify computing modular inverses? 3. If `p` is not prime, does your approach still work? What changes? 4. Implement `mod_exp` iteratively (no recursion) to avoid stack overflow for large exponents.

View

Most Common OA Topics

system design (1) probability stats (1) greedy (1) behavioral (1) arrays (1)

Optiver OA Format and Platform

The Optiver online assessment is delivered through a proctored online platform, most commonly HackerRank. Candidates receive the OA link by email after passing an initial resume review. The coding section typically contains 2 to 3 algorithmic problems with a 70 to 110 minute time limit.

Some Optiver teams include an additional work simulation section that tests judgment and decision-making rather than coding ability. This section is not present for all roles. Check the LeakCode question database filtered by role type to see what past candidates for your specific role reported.

FAQ

Does Optiver have an online assessment?

Yes. Optiver uses an OA as the first technical screen for most engineering and technical roles. It is typically sent after a resume review and before any human interviews. The format has remained consistent across recent hiring cycles.

How hard is the Optiver OA?

Based on candidate reports, Optiver OA problems range from LeetCode medium to hard. Expect at least one problem that requires an efficient algorithm (not brute force) to pass all test cases within the time limit.

Where do these OA questions come from?

All questions in the LeakCode database are sourced from actual candidate reports on 1Point3Acres, Blind, Glassdoor, Reddit, and LeetCode. They are not AI-generated. Each question links to its source where the original report is public.

Related: Optiver All Questions · All OA Questions · Browse Companies · Data Sources