
D. E. Shaw India Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 194 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at D. E. Shaw India.
Software Engineer 1
It started with resume screening, then an online assessment with 3 DSA questions that were medium to hard difficulty. After that, I had two technical interviews. The first one focused on DSA, Java, C++, and OOPS. The second technical interview also focused on DSA, Java, C++, and OOPS.
- A graph-related question was asked.
- Questions about Java Concepts.
- Questions about OOPS principles.
Software Developer
It was the later stages of the interview, so I was invited to the DE Shaw office for in-person rounds. But to my surprise, the interviewers were not present in the office and were at home. I was given a laptop in the office to do the interviews virtually. In one of the rounds, the interviewer was lying on his bed in shorts, which lacked professionalism. I had informed HR that I would have to take a day off from my current job for these rounds, so I lost a whole day's pay. They rejected me even though I was able to answer most questions and refused to provide feedback.
No confirmed questions were included in this interview report.
Software Engineer Intern
The interview process had 3 rounds. The first round was an online assessment which had 3 Data Structures based questions. This was followed by 2 technical rounds and 1 HR round. Each technical round focussed on projects listed on the resume followed by questions on Database Management and Object Oriented Programming
- Can you explain the workflow of your projects?
- Tell me about your projects.
- Questions on Database Management
D. E. Shaw India Software Engineer Interview Questions
Quoted word for word from D. E. Shaw India interview reports.
“Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n > m.”
Read reports →“Find the count of triplets (i, j, k) where i < k < j and nums[i] < nums[k] < nums[j].”
Read reports →“(coding test) You are given a (normal) rooted binary tree, where each node has some value on it. Sum of all values on a path is the value of that path. For each node u, what is the maximum value that you can find, for the path from the root to u, if you can remove at most 2 nodes? (You can't remove root or u itself.)”
Read reports →“Given an array of people's heights, return an array of people who can see others on both sides, using a stack.”
Read reports →“There were N piles of coins with a given number of coins in each. The goal is to equalize the number of coins in all piles by adding or removing coins one by one. Adding a coin costs c1, and removing a coin costs c2. What is the minimum cost to make all piles have the same number of coins, given that you can add any number of coins? Note: Coins can only be removed if a pile has at least one coin.”
Read report →“Can you determine if a path exists from a starting cell to an ending cell in a matrix containing obstacles, using at most K moves?”
Read report →“How would you find the number of substrings that have at least one character with an odd frequency?”
Read report →“Can you find a local maxima in a 2D matrix, where a local maxima is defined as a point greater than all its neighbors?”
Read report →“How can you form a shape made of 4 equilateral triangles using exactly 6 identical matchsticks?”
Read report →Formats, difficulty and experience
Across all 194 D. E. Shaw India interview reports.