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).
Resume based questions Strategy design related: IC SR etc. OLS quest
Machine Learning concepts and a bunch of behavioural/ competency questions which I felt I did really well in.
Stats, brain teaser, options, markets, case study.
Motivation, academic background, technical details of thesis in context of the job, whiteboard prototyping of algorithms.
What is a martingale and why it is the building block in finance. Why the Brownian Motion is so important in finance and what are its characteristics. Write down an algorithm for computing the the square root of a number. Differences between Python and C++
Some questions about BST for the technical portion
Cos'è la PD di un'impresa
All technical math and stats questions
How do you manage your time?
Viewing 9861 - 9870 interview questions