DE Shaw Interview Experience (Off-Campus)

Round 1:

First Round was a Coding round which included 2 coding Questions both medium type and 40 Aptitude Questions which were really hard to answer.

PlatForm _ Hackerrank

1-Find number of substrings in a string which contains ‘a’, ‘b’, ‘c’
2- 2nd Question was related to graph which could be solved using BFS and DFS
Aptitude Questions were really HardTotal 40 Questions
1- 20 Technical which covers areas like SQL, Networking, OS, Threading, BigO Complexity etc
2- 20 Logical which was based on Probability, Permutation and Logical Questions like in JEE Mains.
Round 2 – Code Pair
Palt_Form Hackerrank
This Round was online Coding and Interview Round in which you have to solve some Coding Questions in front of Interviewer and present the best optimal solution
Questions 1- Create Copy of a binary tree with an extra random pointer to any of its node
 I solved it using HashMap using O(N) time complexity but the interviewer wants O(log(N))
You first have to create a tree copy with left and right child storing mapping of an old pointer to new one  using HashMap and then map the random pointer in the new tree.
Question 2-
Delete all element in the linked list whose value is less than x
This was an easy one and you can easily pass all test cases
Technical Questions:
1- Garbage Collector in Java
2- Why we use static in Java
3-How HashMap are Implemented
I was able to answer all but lacked presentation style.

Write your Interview Experience or mail it to

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.