Fragen in Vorstellungsgesprächen in Yung Shue Wan, Hongkong
Vorstellungsgespräche bei HSBC Holdings in Yung Shue Wan
www.hsbc.com / Hauptsitz: London, UK
255 Vorstellungsgespräche in Yung Shue Wan (von 3.573)
Vorstellungsgespräche bei Bloomberg L.P. in Yung Shue Wan
www.bloomberg.com / Hauptsitz: New York, NY
192 Vorstellungsgespräche in Yung Shue Wan (von 6.020)
Vorstellungsgespräche bei AlphaSights in Yung Shue Wan
www.alphasights.com / Hauptsitz: London
198 Vorstellungsgespräche in Yung Shue Wan (von 2.749)
Fragen im Vorstellungsgespräch für in Yung Shue Wan
There are 3 coins. One coin has heads on both sides, one coin has tails on both sides, the third one has head on one side and tail on the other side. Now I pick up one coin and toss. I get head. What is the chance that the coin I picked has heads on both sides? 2/3 i got this question too, but i am still not sure how it is calculated why not 1/2? Mehr Antworten anzeigen Einer oder mehrere Kommentare wurden entfernt. |
There are 25 horses. Each time you can race 5 horses together. Now you need to pick the top three horses among them. How many races do you need to conduct? |
Toss a fair coin between two people. If it end with HHT, A wins the game. If it ends with HTT, B wins the game. Whats the probability of A wining the game. |
You have answered five mental math questions, what’s your confidence that three answers are correct? How about four answers are correct? |
If you have four coins and I have four. We both throw the four and if your four sides equal to mine, I will give you 2 dollar and otherwise you give me 1. Will you do it? |
a asymmetrical dice with 12 faces, 40% to be 12, others are equivalent. two people, choose a number. The man whose number is closer to the result will win. which number should you choose. |
We play a game. Let’s guess the sum of two dices. Who make a guess that is closer to the outcome is the winner. What’s your strategy? |
write a function that accepts a list of items and returns a copy of that list with duplicate items removed eg: [5, 7, 2, 3, 9, 10, 2, 6] -> [5, 7, 2, 3, 9, 10, 6] |
if i was able to work over time |
You and I play a game, we roll two dice and both pick a number before rolling them. The one closer to the sum wins. The distribution is non-uniform, with 40 % chance of getting a sum of 12 and a uniform distribution for all the other numbers. What is your strategy? Go first or second? |