'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
D.E.Shaw interview experience Real time questions & tips from candidates to crack your interview
Associate Developer Intern
D.E.Shaw
4 rounds | 9 Coding problems
Interview preparation journey
Preparation
Duration: 6 months
Topics: Algorithms, Object-Oriented Programming, Graphs, Trees, DP, Databases
Tip

Tip 1 : Practise problems on Leetcode and solve past year company-specific problems
Tip 2 : Be very good at OOPS concepts, study in-depth about Polymorphism, Inheritance, Friend functions, Operator Overloading
Tip 3 : Do at least one project and know every in and out about it

Application process
Where: Campus
Eligibility: 7 CGPA
Resume tip

Tip 1 : Don't fake any project or any programming language on the resume.
Tip 2 : If you are including projects in python or experience in the python language then you must be good with OOPs concepts with implementation.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration95
Interview date31 Aug 2020
Coding problem3

This was a programming test consisting of 3 sections with 1 question each. 25 mins for the 1st section, and 35 for the 2nd and 3rd section. Each section had its own fixed time.

1. Majority Element - II
Easy
10m average time
90% success
0/40

#### You are given an array/list 'ARR' of integers of length â€˜Nâ€™. You are supposed to find all the elements that occur strictly more than floor(N/3) times in the given array/list.

Problem approach

I quickly implemented a brute force solution in 2-3 minutes to pass partially. Then implemented a time-efficient solution with 7^3 time complexity.

2. MegaPrime Numbers
Easy
15m average time
90% success
0/40

View more
3. Jump Game
Moderate
15m average time
85% success
0/80

#### You have been given an array 'ARR' of â€˜Nâ€™ integers. You have to return the minimum number of jumps needed to reach the last index of the array i.e â€˜N - 1â€™.

View more
Problem approach

Solved in a greedy manner.

02
Round
Medium
Video Call
Duration70
Interview date1 Sep 2020
Coding problem3

There were two interviewers on a video call. For the first 25 minutes, the first interviewer asked his questions, and later the second one. For the second 25 minutes, questions related to OOPS were discussed, and also was asked to implement few things.

1.

1. What concepts do you know about OOPS?
2. Implement Runtime polymorphism and Compile time polymorphism.
3. What are virtual functions?
4. Write a Copy constructor for a derived class?
5. He made some changes in my base class written, he added static in front of the virtual keyboard and asked me that now tell how will it behave now?
6. Difference between endl and \n?
7....

View more
Problem approach

Tip 1 : Be very thorough with OOPS concepts
Tip 2 : Don't just read about OOPS do try them and write code for OOPS concepts

2. Alien dictionary
Hard
46m average time
50% success
0/120

#### Write a function that returns the ...

View more
3. Bottom view of binary tree
Moderate
10m average time
90% success
0/80

#### Return the bottom view of the binary tree.

##### Note :
``1. A node will be in the bottom...``
View more
Problem approach

I thought for a bit time then made some trees on the editor and asked him the expected output for those to get the clarity, Then I implemented the DFS were along with depth I stored the direction from parent whether reached node as Left child of a parent or right child and implement smart DFS. The interviewer was satisfied with the entire discussion.

03
Round
Medium
Video Call
Duration60-65 minutes
Interview date1 Nov 2020
Coding problem2

It consisted of two coding problems which involved proper coding it and explaining each and every aspect and I have to show dry run over a few cases

1. Is Binary Heap Tree
Easy
10m average time
90% success
0/40

#### Note:

``A binary tree is a tree in whi...``
View more
Problem approach

Firstly, I solved this using DFS and BFS approach that takes O(N) time so the interviewer asked me to optimize it. Then I used this property of 2*parent,2*parent+1 to solve it in O(logN), I constructed the path from the node to root using a while loop and stored the path. Then traveled from root along that path to reach the required node or if I exceed it then return false.

2. Chocolate Problem
Moderate
15m average time
85% success
0/80

#### Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/li...

View more
Problem approach

I solved using recursion + dynamic programming first then I optimized it using the Binary Search approach.

04
Round
Easy
HR Round
Duration20 minutes
Interview date1 Sep 2020
Coding problem1

It was a very friendly and chill round.

1. Do you have any question for the interviewer?

Here I was supposed to ask the questions from the hiring manager. She asked if I want to know anything about the company or any general questions. So asked him about the projects and teams at Deshaw and some other questions.

Problem approach

Be natural don't try to make a question out of nowhere.

Start a Discussion
Similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by D.E.Shaw
2387 views
Quality Testing Intern
3 rounds | 4 problems
Interviewed by D.E.Shaw
976 views
SDE - 1
4 rounds | 7 problems
Interviewed by D.E.Shaw
1996 views