D.E.Shaw interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
D.E.Shaw
1 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Journey
I have done most of my coding in my final year only, but now regret that I should have started a little bit earlier. I practised mainly from Leetcode and Code Studio.
Application story
I was looking for placement opportunities across different platforms. I came across an opening in De Shaw on Hacker rank. So, I applied through that link.
Why selected/rejected for the role?
I was rejected because I was not able to solve both the DSA problems in the given time frame. The questions were of medium-high difficulty level. I was not able to pass all the test cases by my approach.
Preparation
Duration: 3 Months
Topics: System Design, Algorithms, Dynamic Programming, Arrays, DP, Graphs
Tip 1 : Practice coding
Tip 2 : practice aptitude
Tip 3 : prepare for the core subjects
Application process
Where: Hackerrank
Eligibility: no
Tip 1 : Write short resume
Tip 2 : Never lie about things
Interview rounds
01
Round
Easy
Online Coding Test
Duration90 minutes
Interview date7 May 2022
Coding problem2
Coding round on the hacker rank platform. All questions were time-bound and if you jump ahead in sections, you can’t go back.
1. Strongly Connected Components (Tarjan’s Algorithm)
Hard
15m average time
85% success
0/120
Asked in companies
You are given an unweighted directed graph of 'V' vertices and 'E' edges. Your task is to print all the strongly connected components (SCCs) present in the graph.
2. 0 1 Knapsack
Moderate
0/80
Asked in companies
A thief is robbing a store and can carry a maximum weight of ‘W’ into his knapsack. There are 'N' items available in the store and the weight and value of each item is known to the thief. Considering the constraints of the maximum weight that a knapsack can carry, you have to find the maximum profit that a thief can generate by stealing items.
Note: The thief is not allowed to break the items.
For example, N = 4, W = 10 and the weights and values of items are weights = [6, 1, 5, 3] and values = [3, 6, 1, 4]. Then the best way to fill the knapsack is to choose items with weight 6, 1 and 3. The total value of knapsack = 3 + 6 + 4 = 13.
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
Selected 
12831 views
1 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by D.E.Shaw
Rejected
3170 views
0 comments
0 upvotes
SDE - 1
3 rounds | 10 problems
Interviewed by D.E.Shaw
Rejected
1259 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by D.E.Shaw
Selected 0 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes