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?
The "famous" ant foraging food problem.
Probability and Teasers are asked during technical interviews and BQ is more general questions
three coding questions. They are at leetcode medium
Problem involving expected value for buying shares
three coding problems, 30 probability questions, 26 logic-sequence questions, and some game-like stages called Zap N
Markov and coin tosses questions. Probability that a table with 3 legs places randomly on a circle doesn't fall. Questions about what would happens if features were correleated, why this model not another one, why this hyperparameter. difference ridge vs lasso. difference supervised vs unsupervised
What's the model's performance based on your submission?
Viewing 2631 - 2640 interview questions