Suppose you had eight identical balls. One of them is slightly heavier and you are given a balance scale . What's the fewest number of times you have to use the scale to find the heavier ball?
Intern Interview Questions
248,704 intern interview questions shared by candidates
Find the max value in an array. The array is "semi-sorted". Here is an example: { 1 3 4 7 9 10 12 13 12 6 3 } As you can see, the array increases and then decreases at one point (13).
Suppose we hire you, and you and the rest of the new interns decide to go buy a cup of coffee. Each intern purchases one cup of coffee. One of the interns suggests everyone play a game. Everyone will flip a fair coin, dividing the group of interns into two subgroups: those that got heads and those that got tails. The game is this: whichever group is smaller evenly splits the cost of everyone's cup of coffee (i.e. if there are 5 interns, 3 get H, 2 get T, then the two interns that got tails each buy 2.5 cups of coffee). However, nothing says you need to play this game. You can choose to buy your own cup of coffee and not play the game at all. The question: Should you play this game? (Note: You may assume that there is an odd number of interns, so there are no ties, and that if everyone gets H or everyone gets T, then everyone loses and just buys their own cup of coffee).
non disclosure agreement
What was one of your best achievements on a project in the past?
DS, Algorithms.
Fit questions: Why do you want to be a trader? Why should/shouldn't we hire you? Math: 1. Flip a fair coin 8 times. What's the probability that the number of heads is a multiple of 3? 2. You mentioned on your resume that your favorite author is David Foster Wallace. Estimate the number of copies of Infinite Jest that have been read cover to cover. 3. You have a 2x1x1 brick. Define the distance between two points on the brick to be the infimum of the lengths of all paths between them on the brick. What is the maximum possible distance between two points on the brick?
Given a number n, find the largest number just smaller than n that can be formed using the same digits as n.
Find the second largest element in a Binary Search Tree
Two people each bids a number before throwing a 30 faced die. Whoever gets closer to the number wins and wins the amount of money equal to the number they throw. e.g I bid 15 and you bid 16. the die lands on 10 then i win 10 from you. What's the best strategy and the expected payoff.
Viewing 1 - 10 interview questions