Upload Button Icon Add office photos

DE Shaw

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

DE Shaw Software Engineer Intern Interview Questions and Answers

Updated 30 Aug 2024

DE Shaw Software Engineer Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Campus Placement and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Coding Test 

I was asked One DS Q - about an array of numbers is given, we can one operation k times. The operation was taking any element and multiplying it by 2. The ultimate objective was to maximise the bitwise OR sum of all the elements.

Interview Preparation Tips

Interview preparation tips for other job seekers - Definitely don't panic like me, because as a student I have never done

Interview questions from similar companies

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Mar 2023. There was 1 interview round.

Round 1 - Coding Test 

Solve 2 problems in codility test

Interview experience
4
Good
Difficulty level
Hard
Process Duration
-
Result
-
Round 1 - Coding Test 

Very hard, 2 hard leetcode questions

Interview Preparation Tips

Topics to prepare for Citadel Software Developer interview:
  • dynamic programming
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Aug 2023. There were 3 interview rounds.

Round 1 - Coding Test 

1 hour 30 min test with 2 coding question . one of then was on strings replacing unnecessary symbols with underscore.

Round 2 - Technical 

(2 Questions)

  • Q1. Priority queue and other dsa basics questions
  • Q2. Introduce yourself?
Round 3 - HR 

(2 Questions)

  • Q1. Introduce yourself.
  • Q2. What will you do as a team leader if your teammates are not supportive

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Interview Questionnaire 

4 Questions

  • Q1. Tell me about your internship, B.Tech project(BTP), CV
  • Q2. Implement LRU cache.
  • Ans. 

    Implement LRU cache

    • LRU stands for Least Recently Used

    • It is a cache eviction policy that removes the least recently used item

    • It can be implemented using a doubly linked list and a hash map

    • Newly accessed items are moved to the front of the list

    • When the cache is full, the item at the end of the list is removed

  • Answered by AI
  • Q3. What is virtual memory? Will we need virtual memory even if we have infinite amount of RAM?
  • Ans. 

    Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.

    • Virtual memory uses a combination of RAM and hard disk space to store data.

    • It allows programs to use more memory than is physically available.

    • If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.

    • Even if we had infinite RAM, virtual memory would still be n...

  • Answered by AI
  • Q4. Given an array, Find out maximum length of subarray where max of subarray <= 2*min of subarray
  • Ans. 

    Find maximum length of subarray where max <= 2*min.

    • Iterate through array and keep track of max and min values.

    • Update max length when condition is met.

    • Time complexity: O(n)

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: No CPI cut off and It was open for all departments.

Round: Test
Experience: In muliple choice question Mostly questions were base on maths, probability, c programs, algorithms, Systems. If you are prepared then Questions were not that much tough. Keep strong concepts of Operating systems. For subjective part, Some problems were from maths proofs, some were from probability, some were from algo. We had to write algorithms. etc
Duration: 180 minutes

Round: Problem Statement
Experience: Questions were doable.

Round: Interview
Experience: Everyone was cool, They made me feel comfortable and then started asking questions.
Tips: If you have good rank in online coding competition, do mention it in CV.Most of the students think that GS asks only probability-puzzles. They did not asked me any question on probability or puzzle. Everything they asked was based on Algorithms problems and Operating system. I think it depends on team for which they are hiring. Most important point is don’t lose hope because you have low CPI or you are not good at something. Keep Operating systems fundamental concepts strong.

General Tips: We should balance in Placement and Compititive online coding. Keep in mind Placements and Compititive online coding are some what different things. Keep on improving our mistakes on daily basis. I would strongly suggest you to do introspection daily it will help you to find out your weaknesses and strong points, where we are going wrong etc. There are two thing on which we shoud focus.1. Preparation (I have told everything requered for preparation).2. Get output of all hard work. How to keep our mind on 100% output while the actual exam(placement).For this, I used to go for physical exercise daily in the morning and medidate for 20-30 minutes. Along with exercise i used to do Sudarshan Kriya(Art of Living). Meditation has lot of power :).
Skill Tips: Keep your OS fundamentals strong. To improve codgin skills practice as many problems as you can. Regularly participate in online coding competitions it really helps to solve or approach any new problem. Many time instead of correct answer the approach to solve the problems is very important. How you think, How you approach the problem is checked in interview.
Skills: Coding Skills, Operating Systems , Problem solving skills
College Name: IIT Guwahati
Motivation: The name GS itself enogh for motivation.

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions on DSA and OS.

  • Q1. 

    LRU Cache Design Problem Statement

    Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    • get(key) - Retrieve the value associated with the...
  • Ans. 

    Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.

    • Implement a doubly linked list to keep track of the order of keys based on their usage.

    • Use a hashmap to store key-value pairs for quick access and updates.

    • When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.

    • When the cache reaches...

  • Answered by AI
  • Q2. 

    Maximum of All Subarrays of Size K

    Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...

  • Ans. 

    Find the maximum elements for each subarray of size K in a given array.

    • Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

    • Pop elements from the deque that are out of the current window.

    • Keep track of the maximum element in each subarray of size K.

    • Return the maximum elements for each subarray.

  • Answered by AI
  • Q3. What is virtual memory?
  • Ans. 

    Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.

    • Virtual memory allows programs to use more memory than is physically available on the system.

    • It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.

    • Virtual memory uses a combination of RAM and disk...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAGoldman Sachs interview preparation:Topics to prepare for the interview - Coding Skills, Operating Systems , Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

11 Questions

  • Q1. Print all nodes at a distance k from a given node in binary tree?
  • Q2. RandN function : which generates random number in [1,2,3..N] with equal probability. Given rand5, write a code for rand7 using rand5
  • Ans. 

    Code for rand7 using rand5 function

    • Use rand5 twice to generate a number in [1,25] with equal probability

    • If the number is greater than 21, discard and try again

    • Otherwise, return (number mod 7) + 1

  • Answered by AI
  • Q3. Puzzle: Using all(8,8,3,3) and only operators(*,/,-,+), make 24
  • Q4. How do you implement LRU cache?
  • Ans. 

    LRU cache is implemented using a doubly linked list and a hash map.

    • Create a doubly linked list to keep track of the order of elements in the cache.

    • Create a hash map to store the key-value pairs of the cache.

    • When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.

    • When an element is accessed, move it to the front of the linked list to...

  • Answered by AI
  • Q5. Your current project in Company? A lot of questions from CV? Discussion went on for about 15 minutes?
  • Q6. Then had a lot of questions around java script and java. About different design patterns and web services
  • Q7. A lot of questions around java, collections frameworks, multi threading and so on. (This took a good 25-30 minutes )
  • Q8. A strategy question. It would be asked depending on which team you are being interviewed for.Mine was some apple seller problem. Here knowledge of real world scenario helps. Advice is to observe things aro...
  • Q9. Write down function to select pivot element randomly in Quick Sort
  • Ans. 

    Function to randomly select pivot element in Quick Sort

    • Generate a random index within the range of the array

    • Return the element at the randomly generated index as the pivot

  • Answered by AI
  • Q10. He asked me what is a data structure and why do we use one. Explained him. He asked some real life example of stack and queue. All I could gave him was programming examples but when he insisted on real li...
  • Q11. As we were talking very much on each question. He felt like talking more and from tech he went around for some biggest learning from a mistake/biggest achievement of life kind of questions. There were oth...

Interview Preparation Tips

General Tips: I recently interviewed with Goldman Sachs&#44; and had 4 rounds of interview with them at their campus in Bangalore.
Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

DE Shaw Interview FAQs

How many rounds are there in DE Shaw Software Engineer Intern interview?
DE Shaw interview process usually has 1 rounds. The most common rounds in the DE Shaw interview process are Coding Test.

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

COMPANY BENEFITS

KNR Constructions

20 benefits

COMPANY BENEFITS

IRB Infrastructure

60 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

REVIEWS

Toshiba Software India

No Reviews

INTERVIEWS

MLM COMPANY

No Interviews

DESIGNATION

INTERVIEWS

CAMP Systems International, Inc.

No Interviews

INTERVIEWS

TCL

No Interviews

Tell us how to improve this page.

DE Shaw Software Engineer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Goldman Sachs Interview Questions
3.5
 • 376 Interviews
Morgan Stanley Interview Questions
3.7
 • 291 Interviews
Chetu Interview Questions
3.3
 • 172 Interviews
AVASOFT Interview Questions
3.6
 • 151 Interviews
ivy Interview Questions
3.6
 • 122 Interviews
Axtria Interview Questions
3.1
 • 115 Interviews
Thomson Reuters Interview Questions
4.1
 • 112 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
EbixCash Limited Interview Questions
4.0
 • 102 Interviews
View all

DE Shaw Software Engineer Intern Reviews and Ratings

based on 2 reviews

3.0/5

Rating in categories

4.3

Skill development

2.3

Work-life balance

4.0

Salary

3.0

Job security

3.6

Company culture

3.0

Promotions

4.3

Work satisfaction

Explore 2 Reviews and Ratings
Analyst
165 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Analyst
146 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Manager
73 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Project Lead
53 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Member Technical Staff
48 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare DE Shaw with

Goldman Sachs

3.5
Compare

Morgan Stanley

3.7
Compare

Citadel

3.9
Compare

Blackrock

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent