Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
D.E.Shaw interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

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

Interview preparation journey

expand-icon
Preparation
Duration: 4 Months
Topics: Data structures, algorithms, operating systems,oops, databases
Tip
Tip

Tip 1 : Practice practice practice 
Tip 2 : consistent work

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

Tip 1 : use action words in ur resume
Tip 2 : never leave out too much of blank space

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date8 Feb 2022
Coding problem3

1. Total Strings

Moderate
15m average time
86% success
0/80
Asked in companies
GoogleInnovaccerMathworks

You are given a positive integer 'N'. Your task is to find the number of strings of length ‘N’ that can be formed using only the characters ‘a’, ‘b’ and ‘c’. The strings formed should be such that the number of ‘b’ and ‘c’ in the string is at most 1 and 2, respectively.

Example:
Let’s say N = 2. The strings of length 2, which satisfy the given constraints are: “aa”, “ab”, “ac”, “ba”, “bc”, “ca”, “cb”, “cc”. Hence, the output is 8.
Try solving now

2. Find Minimum Number Of Coins

Easy
15m average time
85% success
0/40
Asked in companies
AdobePaytm (One97 Communications Limited)Myntra

Given an infinite supply of Indian currency i.e. [1, 2, 5, 10, 20, 50, 100, 500, 1000] valued coins and an amount 'N'.


Find the minimum coins needed to make the sum equal to 'N'. You have to return the list containing the value of coins required in decreasing order.


For Example
For Amount = 70, the minimum number of coins required is 2 i.e an Rs. 50 coin and a Rs. 20 coin.
Note
It is always possible to find the minimum number of coins for the given amount. So, the answer will always exist.
Try solving now

3. Pair count.

Moderate
0/80
Asked in companies
PayPalAmazonGoogle

You are given an array ‘ARR’, and a positive integer ‘K’. Your task is to count the total number of pairs whose sum is divisible by ‘K’.

For example:
You are given, ‘ARR’ =[4, 3, 5, 1, 4, 5], and ‘K’ = 5.  In the given array the pair sums divisible by ‘K’ are [4,1], [5, 5], [4, 1]. Since there are a total of 3 pairs, the answer is 3.
Try solving now
02
Round
Hard
Video Call
Duration100 minutes
Interview date3 Mar 2022
Coding problem2

Round had 2 DSA questions, followed by roughly 30-40 questions on OS,DBMS,oops altogether.

1. Merge Two Sorted Arrays

Moderate
15m average time
85% success
0/80
Asked in companies
RIVIGOHikeFreshworks

Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may have to assume that ‘ARR1’ has a size equal to ‘M’ + ‘N’ such that ‘ARR1’ has enough space to add all the elements of ‘ARR2’ in ‘ARR1’.

For example:

‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’. 
‘ARR1’ = [3 4 6 9 10]
Try solving now

2. Longest Common Subsequence

Moderate
0/80
Asked in companies
GoogleAmazonVisa

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

Problem approach

Consider the input strings “ABCDGH” and “AEDFHR. Last characters do not match for the strings. So length of LCS can be written as: 
L(“ABCDGH”, “AEDFHR”) = MAX ( L(“ABCDG”, “AEDFHR”), L(“ABCDGH”, “AEDFH”) )
So the LCS problem has optimal substructure property as the main problem can be solved using solutions to subproblems.If we draw the complete recursion tree, then we can see that there are many subproblems which are solved again and again. So this problem has Overlapping Substructure property and recomputation of same subproblems can be avoided by either using Memoization or Tabulation.

Try solving now
03
Round
Hard
Video Call
Duration90 Minutes
Interview date31 Mar 2022
Coding problem1

One hard question and SQL questions.

1. Number of Flips

Easy
0/40
Asked in companies
InfosysInfo Edge India (Naukri.com)Walmart

Ninja is learning the binary representation of the numbers. He wanted to practice the topic, so he picked a question. The problem statement says, two numbers, ‘A’ and ‘B’ are given. Find the number of bits of ‘B’ that should be flipped to convert it into ‘A’.Can you help Ninja to solve this problem?

You are given two integers, ‘A’ and ‘B’.Find the number of bits of ‘B’ that should be flipped to convert it into ‘A’.

For Example
If ‘A’ is 13(1101) and ‘B’ is 7(0111), The number of bits that should be flipped is 2(0111). 
Try solving now
04
Round
Easy
HR Round
Duration30 Minutes
Interview date22 Apr 2022
Coding problem1

HR Discussion on call regarding my Projects,internships and 5-6 HR round questions

1. Basic HR Questions

Whats the most challenging work you ever took? How you solved that problem? What if you have a urgent Problem ,for ex, some imp bug fix which is really urgent, what are the steps which you take? What do you know about DE Shaw?

Problem approach

Tip 1 : Be honest
Tip 2 : Communicate well with the interviewer while speaking about the experiences you had in past.

Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 7 problems
Interviewed by D.E.Shaw
10126 views
1 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by D.E.Shaw
2683 views
0 comments
0 upvotes
SDE - 1
3 rounds | 10 problems
Interviewed by D.E.Shaw
725 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by D.E.Shaw
0 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
105168 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
50089 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
31230 views
6 comments
0 upvotes