DE Shaw Interview Questions, Process, and Tips for Freshers

1 hour- data interpretation

Simple topic for freshers.

Q1. Quantitative Puzzles
Add your answer

There was questions from verbal, quant and logical type

Q1. What is economic parity, CRR or questions related to your hobbies
Add your answer

APTRITUDE QUESTIONS,CODING

Q1. OOPS,CN,OS,DBMS
Add your answer

3 ques each with 20 min time limit

Q1. 2 dsa ques with oops and os
Add your answer

Q1. 2 dsa with sql
Ans. 
Combining data structures and algorithms with SQL for efficient data manipulation and retrieval.
• Use data structures like arrays, linked lists, trees, graphs for efficient storage and retrieval of data in memory.

• Implement algorithms like sorting, searching, and graph traversal to manipulate data effectively.

• Leverage SQL queries to interact with databases and perform operations like filtering, sorting, and joining data.

• C...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

Online Test Platform - HackerRank
Test Access Window – between 10:00 AM to 6:00 PM
Online Test Pattern –

Total Duration of Test – 120 mins
Total No. of Sections - 5
Section 1 – One Coding Question - Easy difficulty (20 mins)
Section 2 – One Coding Question - Medium difficulty (30 mins)
Section 3 – One Coding Question - Medium difficulty (30 mins)
Section 4 - Technical MCQs - 10 questions (20 mins)
Section 5 - Aptitude MCQs - 10 questions (20 mins)
Programming Sections (1, 2 and 3): This will have 3 coding questions with a time limit of 80 minutes. It is mandatory for you to attempt the 1st coding question before moving to the second question and third. You cannot revisit question/section once you proceed ahead
MCQ Sections (4 and 5): This will have 10 technical and 10 aptitude questions, with a time limit of 20 minutes each. Each correct answer will carry 2 marks and wrong answer will carry negative 0.5
Technical questions will cover Data structures & algorithms, Operating systems, Database systems, SQL and Networks.
Aptitude questions will cover Quantitative Aptitude, Problem solving and Logical & verbal Reasoning

Q1. 
Tower Building Problem Statement
Given an array 'ARR' of 'N' cubes, you need to construct towers such that each cube can either be placed on top of an existing tower or start a new one. The restriction is...read more
Ans. 
The task is to determine the minimum number of towers needed to stack cubes in a specific order.
• Iterate through the array of cubes and maintain a stack to keep track of towers.

• For each cube, check if it can be placed on an existing tower or start a new one.

• Update the stack based on the cube's size and count the number of towers needed.

• Return the minimum number of towers required.

• Example: For input N = 3, ARR = [3, 2, 1
Answered by AI
View 1 more answer
Q2. 
Minimum Removals Problem Statement
Given an array ARR of size N and an integer K, determine the minimum number of elements that must be removed from the array so that the difference between the maximum an...read more
Ans. 
The problem involves finding the minimum number of elements to remove from an array so that the difference between the maximum and minimum element is less than or equal to a given value.
• Iterate through the array and keep track of the minimum and maximum elements.

• Calculate the difference between the maximum and minimum elements.

• If the difference is greater than the given value, increment the count of elements to remove.

• ...read more
Answered by AI
Add your answer
Q3. 
Conquering the Best Kingdom Problem Statement
Aragorn, an influential ruler, aspires to expand his power by conquering more kingdoms. There are 'N' kingdoms numbered from 0 to N-1, forming a tree structur...read more
Ans. 
Given a tree structure of kingdoms, determine if it's possible to conquer more kingdoms than Aragorn by strategically choosing the starting kingdom.
• Start at the kingdom adjacent to Aragorn's initial kingdom

• Choose the kingdom that allows you to capture the most number of kingdoms in subsequent turns

• Consider the tree structure to plan your conquest strategically
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

They called and asked me to choose a date and time I would be free in the upcoming week for my interview.
I chose 10th March 5 pm. 

Interviewer was pretty friendly. Started with some resume based questions. Asked me OS, DBMS and JAVA based questions. A coding question was asked to code. Asked me OOPS related questions too.

Q1. 
K Most Frequent Elements Problem Statement
Given an integer array ARR and an integer K, identify the K most frequent elements within ARR. Return these elements sorted in ascending order.
Example:
Input:
...read more
Ans. 
Identify K most frequent elements in an array and return them sorted in ascending order.
• Use a hashmap to store the frequency of each element in the array.

• Sort the elements based on their frequency in descending order.

• Return the first K elements from the sorted list.
Answered by AI
Add your answer