You roll 100 fair six-sided dice. Whenever the results contain at least one occurrence of each value in {1,2,3,4,5,6}, you remove one complete set {1,2,3,4,5,6} from the roll. You repeat this procedure as long as at least one full set can be removed. What is the expected number of dice remaining once no more complete sets can be removed?
How to grow decision trees?
How would you build a strategy to consistently win at a Monopoly game ?
Array question that you can't prepared for (sleep well), Bayes expectation
Coding question: find all prime numbers smaller than n
What's a challenging problem that you solved?
Data Structure (dictionary, heap), Algorithms (sorting, dynamic programming, array)
Bayesian Theorem, Dynamic Programing, Probability theorem.
Brainteaser which is based on the Bayes Formula
Dynamic programming questions. Standard brainteasers, probability and statistics questions
Viewing 8041 - 8050 interview questions