D.E.Shaw interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

D.E.Shaw
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, java
Tip
Tip

Tip 1 - Practice Atleast 250 Questions from geeks from geeks and coding ninjas
Tip 2 - Ex- Do atleast 2 good projects

Application process
Where: Hackerrank
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume and be confident.

Interview rounds

01
Round
Hard
Online Coding Interview
Duration60 minutes
Interview date12 Aug 2021
Coding problem1

3 sections. 20 min each. 

section 1: 20 aptitude questions and was really hard. Avg no of questions solved is 4. 

section 2: 20 (C++ & Java) oops related questions and other output questions too. (level was good. G-Facts) 

In C++: mainly Virtual functions, virtual destructor, copy constructor, initializer list, virtual inheritance questions, inner classes, etc.
In java: mainly inner classes, Base reference, and Child object concept, overriding questions, etc. 


section 3: Write running code for the following problem:
Find 2 nos in a sorted array whose DIFFERENCE is given no K

1. Pairs with difference K

Moderate
0/80
Asked in companies
Goldman SachsOraclePhonePe

You are given with an array of integers and an integer K. You have to find and print the count of all such pairs which have difference K.

Note: Take absolute difference between the elements of the array.

Problem approach

Traverse the array from left to right, and for each element arr[i], binary search for arr[i] + n in arr[i+1..n-1]. If the element is found, return the pair.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date13 Aug 2021
Coding problem1

Started with a simple question and moved in depth.
What is a dangling reference?
Moved on to what happens when we access it?
How to handle it? I said we can use reference count or std::auto_ptr to avoid dangling references. He was happy with the auto_ptr smart pointer concept.
Then what happens when another auto_ptr assigns previously assigned auto_ptr (i.e when we use assignment operator in auto_ptr)? I said only one auto_ptr can hold an object, so the old auto_ptr will point to NULL.
Now, what happens when Old auto_ptr tries to access an object (i.e NULL). I said runtime exception and program may crash.
Name the type of exception. I said maybe segmentation fault.

1. Largest BST

Easy
10m average time
90% success
0/40
Asked in company
D.E.Shaw

Ninja is very fond of playing with Binary Trees. He is randomly searching some binary trees structures from the internet. He has learnt a new concept of Binary Search Trees.

Now a random thought comes in his mind to find the largest subtree in the binary tree which is also a binary search tree.

As Ninja is very new to the concepts of BST. He couldn't make it to the solution. So, he asks for your help. Help Ninja!.

A binary search tree (BST) is a binary tree data structure which has the following properties.

• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.
Try solving now
03
Round
Medium
Video Call
Duration60 minutes
Interview date13 Aug 2021
Coding problem1

What is Zombie process? Write code to create Zombie process.
What is Orphan process? Write code in C to create Orphan process too.
One query. Given a table having attributes stud_name, English, phy, chem., maths. Write a query to display the name of student in descending order of their aggregate marks.

1. Inplace rotate matrix 90 degree

Easy
12m average time
80% success
0/40
Asked in companies
OLX GroupSalesforceUrban Company (UrbanClap)

You are given a square matrix of non-negative integers of size 'N x N'. Your task is to rotate that array by 90 degrees in an anti-clockwise direction without using any extra space.

For example:

For given 2D array :

    [    [ 1,  2,  3 ],
         [ 4,  5,  6 ],
         [ 7,  8,  9 ]  ]

After 90 degree rotation in anti clockwise direction, it will become:

    [   [ 3,  6,  9 ],
        [ 2,  5,  8 ],
        [ 1,  4,  7 ]   ]
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
SDE - 1
4 rounds | 7 problems
Interviewed by D.E.Shaw
12832 views
1 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by D.E.Shaw
3170 views
0 comments
0 upvotes
SDE - 1
3 rounds | 10 problems
Interviewed by D.E.Shaw
1259 views
0 comments
0 upvotes
SDE - 1
1 rounds | 2 problems
Interviewed by D.E.Shaw
4002 views
1 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115097 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58238 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35147 views
7 comments
0 upvotes