Open In App

DE Shaw Interview Experience (Off-Campus)

Last Updated : 26 Aug, 2021
Like Article

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).

  1. 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.
  2. 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.

  1. Asked me to explain one of my projects.

Verdict: Not Selected

Like Article
Suggest improvement
Share your thoughts in the comments

Similar Reads