Recently received Optiver The whole process of the OA invitation is quite challenging, and it feels like it examines how you can stay calm under high pressure, especially the combination of algorithms and math. I've heard of quite a few of my buddies getting stuck on the math questions or not getting to finish them because they were too pressed for time.
In my preparation, I used the Programhelp 's no-holds-barred online ghostwriting service helped me solve my programming dilemma quickly without being slowed down by time and details, and maintained my personal coding style throughout the process. After this OA was completed, I finally made it to the next round of interviews, and I wanted to share my experience and some advice on how to prepare for the exams in the hopes that it will help you!
Interview Overview
firms: Optiver
duration:90 minutes
quantity of questions: 3 to 4 programming questions on algorithms, mathematical reasoning, data structures, etc.
difficulty: Moderate to high, especially topics combining math and programming
Platform: Online platform provided by Optiver
Language: Python, C++ (optional)
Optiver OA real question analysis
1. Two Sum Variation
So, the first problem is a variation of the classic "Two Sum" problem. You're given an array, and you need to find You're given an array, and you need to find two numbers that add up to a target value. But there's a twist: you need to handle floating point precision properly, which is what trips most people up. But there's a twist: you need to handle floating point precision properly, which is what trips most people up.
Example.
Input: arr = [1.2, 3.4, 2.1, 5.6], target = 5.3
Output: [0, 2]
How I Solved It.
I used a hash map to store the numbers and check if the complement exists. But since we're dealing with floating point numbers, I made sure to I used a hash map to store the numbers and check if the complement exists. This avoids issues with tiny precision errors that can sometimes happen with floating point numbers.
2. Binary Search for Missing Number
This one was pretty straightforward but tricky in its own way. You're given an array from 1 to N with one number missing. You need to find that missing number using binary search.
Example.
Input: arr = [1, 2, 3, 5], N = 5
Output: 4
How I Solved It.
I used binary search on the array. The key idea here is that in a sorted array, the index of each element should match its value. If the index is smaller than the value, then the missing number is in the right half; if it's bigger, the missing number is in the left half. If the index is smaller than the value, then the missing number is in the right half; if it's bigger, the missing number is in the left half. quickly.
3. Math Puzzle - Probability Calculation
This one was a bit of a brain teaser. You had to calculate the probability of a certain event happening given a random experiment. It involved using combinatorics and probability formulas.
Example.
In a deck of 52 cards, calculate the probability of drawing at least one Ace in 5 draws without replacement.
How I Solved It.
Instead of directly calculating the probability of drawing at least one Ace, I first calculated the opposite - the probability of not Then I subtracted that from 1 to get the probability of getting at least one Ace. This is a common trick when dealing with probability problems. This is a common trick when dealing with probability problems.
FAQ
Q: Is Optiver OA difficult?
A: The overall difficulty is medium to high, the programming questions are not that complicated, but the combination of math and algorithmic questions can make it hard to stay afloat under time pressure. Time management is especially important!
Q: How can I increase my problem solving speed?
A: When doing the questions, look through all the questions and make a rough time allocation. Do the questions you are sure of first, and skip the difficult ones to avoid wasting too much time where you are stuck.
Q: How exactly does Programhelp help you?
A: Programhelp's no-frills online ghostwriting service saved me a lot of time when I was working on my problems, not only by giving me optimization suggestions when implementing the algorithms, but also by ensuring that the code was consistent in style, which allowed me to focus more on thinking and testing.
You're one step away from an offer.
Optiver's OA was indeed a bit difficult, but through thorough preparation, reasonable time management, and the help of Programhelp, I successfully completed all the questions and made it to the next round of interviews.
If you're preparing a similar OA, especially for a company with comprehensive requirements like Optiver, try the Programhelp. Our no-holds-barred online ghostwriting service not only ensures the quality of your code, but also helps you stay calm and confident in high-pressure situations, and tackle each round of challenges with ease.
