I’d never want to go through the interview again… but here are some questions I got that you should practice, practice, practice…
- Given a 2D grid, there are rocks in every grid. You are only able to move to the right and up - what is the maximum number of rocks you can pick up?
- Use a recursive function to write a fibonacci sequence. What is the recursive method’s benefits and problems?
- Explain what a queue and stack is. Use stack to make a queue. What is the worst time complexity of a queue push and pop? What is the worst time complexity of a amortized time complexity?
- There are 52 cards in a deck not including jokers. What is the probabiltiy you pick an Ace of Spades?
- Assume you put back any card you pull that is not an Ace of Spades. What is the expected value number of times it takes for you to pull an Ace of Spades?
- If the payoff for pulling an ace of spades is $1 million and you have to pay $x if you don’t pull an ace of spades, what is a reasonable $x value to propose?
- Why do you want to do Quant?
- Why do you want to work at GS?