DE Shaw Interview Experience (Off-Campus)
Round 1: Greeted each other. Asked me to introduce myself (I hadn’t prepared that, I strongly recommend everyone should). Asked me about the data structures I was familiar with. (I said I am comfortable with trees too).
- Convert a BST to Max Heap in O(n) time. I could give a nlogn approach but wasn’t able to optimize it. It was followed by general questions on trees.
- There’s a trojan virus in a network of computers. You’ve to find the source of the virus. The network is given in the form of a graph. (I explained my approach using topological sort. I was asked to write a running code and give an alternate approach).
They increased the complexity of the question(don’t remember) and I was able to give a fair working solution.
- Asked me to explain one of my projects.
Verdict: Not Selected