Coding: Array length n. Integer k. Find the minimum sub-array length (no elements can be skipped) for which the sub-array has at least k distinct elements. If no such sub-array exists return -1. Implement naively. What is the complexity. Implement efficiently
1) dynamic programming: cansum(int a, list [b,c,d]), return whether a can be a sum of elements in the list; 2) option pricing: explain ito's lemma 3) two players, one bid a k from U(0,1), expectation of draws to bid the opponent
Intuition of zero-arbitrage in options pricing. Interviewer guided the thought process.
Q: They ask about the strategies you use in more detail than is necessary.
Q: what is your signal
Explain linear regression and give me its closed form solution
I don't remember much but it was pretty basic stuff.
Finding relation among a big dataset
What is the Put Call Parity
Pair programming problem solvable with dynamic programming
Viewing 7781 - 7790 interview questions