The example sequence 011212201220200112 ... is constructed as follows: 1. The first element in the sequence is 0. 2. For each iteration, repeat the following action: take a copy of the entire current sequence, replace 0 with 1, 1 with 2, and 2 with 0, and place it at the end of the current sequence. E.g. 0 -> 01 -> 0112 -> 01121220 -> ... Create an algorithm which determines what number is at the Nth position in the sequence (using 0-based indexing).
Formal maths & puzzles + hackerrank.
How do you manage your time?
Explain what is random forest. Bias and variance in this case.
They asked me why I wanted to work for Optiver
One question on calculating the expectation value of a card game and then coding it up in Python using recursive functions
One question requires constructing a class. One is about optimization. The last one is dynamic programming. Questions are okay but need preparation.
Probability section had expected values, random walks, and Markov chains based questions.
Describe what you have done in the year since your previous application.
What is the 100th derivative of f(x) = x*exp(x^2) at x = 0?
Viewing 2631 - 2640 interview questions