Filter interviews by
I applied via Referral and was interviewed before Dec 2022. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Feb 2022. There was 1 interview round.
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
Hackerrank is a good paltform and very flexible, our webcam was turned on in order to prevent students from cheating
Your task is to identify the position of the only '1' bit in the binary representation of a given non-negative integer N
. The representation contains exactly one '1' and the rest are...
Find the position of the only '1' bit in the binary representation of a given non-negative integer.
Iterate through the bits of the integer to find the position of the lone '1' bit.
Use bitwise operations to check if there is exactly one '1' bit in the binary representation.
Return the position of the lone '1' bit or -1 if there isn't exactly one '1'.
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle base cases where N=0 and N=1 separately.
Consider using modulo operation to avoid overflow when dealing with large numbers.
Round duration - 40 minutes
Round difficulty - Hard
Round was conducted on zoom platform. There were 40 students there and then each one of them were assigned break-out rroms for interviews.
Tip 1 : try to keep only those things in resume on which you have very good command and you should be able to answer all of the questions(upto moderate level) related to your technical skills
Tip 2 : mention your projects with brief description, try avoiding very high level description because some times reader might not be able to understand your work, keep it descriptive and understandable
Tip 1 : major team project is helpful
Tip 2 : list down only the related achievements with the role you are applying for
I appeared for an interview in Nov 2020.
Round duration - 95 minutes
Round difficulty - Easy
This round was conducted in Hackerrank portal for a total duration of 95 minutes and was divided into 4 sections.
1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes
This Round was Conducted on Hackerrank (Webcam Enabled).
Wong wants to borrow money from Dr. Strange, who insists Wong must win a coin game first. The game involves two players taking turns to remove one coin from either end of a row...
Given an array of coin values, determine the maximum value Wong can obtain by playing a coin game against Dr. Strange.
Wong plays first and can remove one coin from either end of the array on each turn.
The game ends when no coins are left, and the player with the highest total value wins.
Consider different scenarios like having an odd or even number of coins in the array.
Given a sorted array A consisting of N integers, your task is to find the magic index in the given array, where the magic index is defined as an index i such that A[i] = i...
Find the magic index in a sorted array where A[i] = i.
Use binary search to efficiently find the magic index in the sorted array.
Check the middle element of the array and compare it with its index to determine the direction to search.
Repeat the process on the left or right half of the array until the magic index is found or no more elements to search.
Round duration - 120 minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair : Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 10:00 A.M to 12:00 P.M
Given a garden that extends along a one-dimensional x-axis from point 0 to point N, your task is to determine the minimum number of taps needed to water the enti...
Find the minimum number of taps needed to water the entire garden using given tap ranges.
Iterate over taps and update the farthest point each tap can reach.
Use a greedy approach to select the tap that can water the farthest point.
If a tap can't water any point, return -1.
Example: For ranges = [3, 4, 1, 1, 0, 0], tap at position 1 can water the entire garden.
Harshit wants to save up money for his first car by depositing money daily in the Ninja bank with a specific increment strategy.
Starting with 1 rupee on the first Monday, th...
Calculate the total money accumulated by Harshit in Ninja bank after N days with a specific increment strategy.
Start with 1 rupee on the first Monday and increase by 1 rupee each day from Tuesday to Sunday.
Each new Monday starts with an additional rupee more than the previous Monday's deposit.
Calculate the total amount of money accumulated after N days for each test case.
Example: For N = 2, total amount is 3 rupees; fo
Round duration - 120 minutes
Round difficulty - Hard
A lot of Variants based on Constraints were asked in this Round. They will ask you to write the final code for every question before Submitting it(run all test cases) so you won’t get any hints after running test cases in the IDE. ( So don’t Submit your code before dry running it on a lot of Test Cases on pen & paper , they allow to use pen & blank paper at the time of Interviews) .The Interviewers tried to trick in case of time complexities even if you gave the best one. So try to be confident.
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.
Keep track of the maximum profit after the first transaction and the maximum profit after the second transaction.
Return the sum of these t...
You are given the prices of a particular stock over 'N' consecutive days. Your task is to find the maximum profit that can be obtained by completing at most two transact...
Find the maximum profit that can be obtained by completing at most two transactions of buying and selling a stock.
Iterate through the array of stock prices and calculate the maximum profit that can be obtained by completing at most two transactions.
Keep track of the maximum profit that can be obtained by selling the stock on each day after buying it on a previous day.
Consider all possible combinations of two transactio...
Round duration - 30 minutes
Round difficulty - Easy
This was a Telephonic Round (Audio Call). The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.
Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...
Calculate uneaten carrots by rabbits with specific jumping factors.
Iterate through each carrot and check if any rabbit jumps on it.
Use the jumping factors to determine which carrots will be eaten.
Subtract the eaten carrots from the total to get the uneaten carrots.
Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : For a company like DE Shaw, practicing medium and hard difficulty level coding questions would be the way to go.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.
Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.
DE Shaw interview questions for popular designations
Get interview-ready with Top DE Shaw Interview Questions
I appeared for an interview before Sep 2020.
Round duration - 150 Minutes
Round difficulty - Medium
This first round was the Online test which was 1 Hour 95 Minutes Long. It was Divided
as Follows.
1. Aptitude Section (Arithmetic + Analytical) 14 Questions – 26 Minutes
2. Technical MCQs( Computer Science) 14 Questions – 19 Minutes
3. Coding Question – 20 Minutes
4. Coding Question – 30 Minutes
5. Coding Questions :
You are provided with an array ARR
of positive integers. Each integer represents the number of liters of water in a bucket. The goal is to make the liters of water in ...
Given an array of water buckets, find the minimum liters of water to remove to make all buckets equal.
Iterate through the array to find the most common water level
Calculate the total liters needed to make all buckets equal by subtracting each bucket's water level from the most common level
Sum up the total liters needed to remove
Given two arrays/lists A
and B
, each of size N
, and an integer K
, you need to determine the K
maximum and valid sum combinations from all possible combinations of ...
The problem involves finding the K maximum sum combinations from two arrays by adding one element from each array.
Iterate through all possible sum combinations of elements from arrays A and B.
Store the sums in a max heap to keep track of the K maximum sums.
Pop the top K elements from the max heap to get the K maximum sum combinations.
Round duration - 150 Minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair: Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...
Find the minimum number of fountains to activate to water the entire garden.
Iterate through the array to find the coverage of each fountain.
Keep track of the farthest coverage reached by each activated fountain.
Activate the fountain that covers the farthest distance not yet covered.
Repeat until the entire garden is watered.
Round duration - 150 Minutes
Round difficulty - Medium
This was also an Online F2F Technical Round conducted on Codepair : Hackerrank.
Dynamic Programming Based Not So Easy Level:
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Dynamic Programming Based Not So Medium Level
Best Time to Buy and Sell Stock with Cooldown
Best Time to Buy and Sell Stock with Transaction Fee
Dynamic Programming Based Hard Level
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV
They asked me a Lot of Questions like:
How did you arrive at this Solution ?
Why is this Approach Right ?
Can You do this in Better time & space complexities ? (Although I have done in Best time Complexity but they asked this to check my confidence level on my codes).
A lot of Variants based on Constraints.
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...
The task is to determine the maximum profit achievable with at most K transactions by buying and selling stocks.
Iterate through the array and keep track of the minimum price to buy and maximum profit for each transaction.
Use dynamic programming to store the maximum profit at each day with each possible number of transactions.
Consider edge cases like when K is 0 or when the array is empty.
Example: For input N = 6, PRICE...
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.
Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy a...
Tip 1 : Solve atleast 300 coding questions.
Tip 2 : Have some good projects on resume.
Tip 3 : Be truthful.
Tip 1 : Have 2 or 3 good projects.
Tip 2 : Don't lie on your resume.
I appeared for an interview before Sep 2020.
Round duration - 95 Minutes
Round difficulty - Easy
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.
You are given an array ARR
of integers of length N
. Your task is to find all the elements that occur strictly more than floor(N/3)
times in the given array.
Given two integers Left
and Right
, determine the count of 'megaprime' numbers within the inclusive range from 'Left' to 'Right'. A 'megaprime' number is a prime number ...
In this problem, you are given an array ARR
consisting of N
integers. Your task is to determine the minimum number of jumps required to reach the last index of the array N - 1
....
Round duration - 70 Minutes
Round difficulty - Medium
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.
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...
Given a binary tree, determine and return its bottom view when viewed from left to right. Assume that each child of a node is positioned at a 45-degree angle from its parent.
N...
Round duration - 60-65 minutes
Round difficulty - Medium
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
You are given a binary tree of integers. Your task is to determine if it is a binary heap tree or not.
The first line of input contains an integer ‘T’ denoti...
You are given an array/list CHOCOLATES
of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...
Round duration - 20 minutes
Round difficulty - Easy
It was a very friendly and chill round.
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
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.
I applied via Company Website and was interviewed in Apr 2021. There were 3 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 80 minutes
Round difficulty - Easy
This round was scheduled in the evening hours around 7pm at Hackerrank platform and all the participants were required to fill a form which was shared 2 days prior to the test date. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the number of ways to make change for each value up to the specified value.
Iterate through each denomination and update the array accordingly.
The final answer will be stored in the last cell of the array.
Example: For N=3, D=[1, 2...
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an array of integers from 0 to (N-2).
Iterate through the array and keep track of the count of each number using a hashmap.
Return the number with a count greater than 1 as the duplicate number.
Alternatively, use Floyd's Tortoise and Hare algorithm to find the duplicate number in O(N) time and O(1) space.
Round duration - 45 minutes
Round difficulty - Hard
This round was conducted on Zoom platform. I was shared the invitation link one day prior to the interview and also was told the name of my interviewer. I looked at the profile of the interviewer at linked.in and got a better understanding of what kind of person he was and prepared accordingly. The round was scheduled at 3 :00 pm on 20th August and I was eagerly waiting for the clock hands to reach 3 o'clock since morning and finally I went in front of him after wearing a white shirt and a black coat over it along with a tie over it.
Given an array of integers 'ARR' and an integer 'K', determine the first negative integer in every contiguous subarray (or window) of size 'K'. If a window...
Find the first negative integer in every window of size K in an array.
Iterate through the array using a sliding window approach of size K
For each window, find the first negative integer and add it to the result array
If no negative integer is found in a window, add 0 to the result array
Tip 1 : Practice all DSA questions from interview bit
Tip 2 : Do Atleast 3 project one should be major, if it's in web dev it would be beneficial.
Tip 3 : Should be good in communication skills
Tip 1 : resume should be short and descriptive
Tip 2 : mention all the important projects that you have worked on
Tip 3 : better if resume is enclosed in single page
I appeared for an interview before Sep 2020.
Round duration - 75 minutes
Round difficulty - Hard
This was a pure coding round consisting of three questions where time allotted for one easy question was 15 minutes while the other two questions were to solved in 30 minutes each.
total time = 15+30+30= 75 minutes
Develop a program to determine the number of '1's in the binary form of a given integer.
The input consists of a single line containing an integer N.
The outpu...
Develop a program to count the number of '1's in the binary form of a given integer.
Convert the given integer to its binary representation
Count the number of '1's in the binary representation
Return the count of '1's as the output
Handle constraints such as input range
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...
Find the length of the longest strictly increasing subsequence of heights of students in a row.
Iterate through the heights array and for each student, find the length of the longest increasing subsequence ending at that student.
Use dynamic programming to keep track of the longest increasing subsequence length for each student.
Return the maximum length found in the dynamic programming array as the result.
Example: For he...
Round duration - 45 minutes
Round difficulty - Hard
There were 2 interviewers and the round was carried out on code pair platform of HackerRank
Prateek, a kindergarten teacher, needs to distribute candies to his class. Each child has a performance grade, and all students stand in a line.
The rules for distrib...
Calculate the minimum number of candies needed to distribute to students based on their performance grades.
Create an array to store the minimum candies needed for each student.
Iterate through the students' ratings from left to right, comparing each student with the previous one to determine the candy count.
Iterate through the students' ratings from right to left, comparing each student with the next one to ensure the c...
Tip 1 : Single page resume but brief
Tip 2 : Major team product is must
Tip 3 : Regular coding practice on GFG, Leetcode and coding ninjas type platforms
Tip 1 : Consists the brief of your skill set
Tip 2 : Github link of projects should be provided
Tip 3 : Mention clearly if you have done a team project
Top trending discussions
Some of the top questions asked at the DE Shaw interview -
The duration of DE Shaw interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 77 interviews
Interview experience
based on 154 reviews
Rating in categories
Analyst
165
salaries
| ₹13 L/yr - ₹32 L/yr |
Senior Analyst
127
salaries
| ₹10.1 L/yr - ₹38 L/yr |
Manager
70
salaries
| ₹14 L/yr - ₹60 L/yr |
Associate
56
salaries
| ₹8 L/yr - ₹28.8 L/yr |
Project Lead
53
salaries
| ₹25 L/yr - ₹94 L/yr |
Morgan Stanley
Citadel
Blackrock
AQR Capital Management