Some of the DE SHAW placement papers are presented in this article. The basic motive behind this is to help the students to proceed further into the DE Shaw Recruitment Process. Here, you will get all the information about the DE Shaw placement papers, test pattern, syllabus and also some previously asked questions.

**Get to know the DE Shaw Recruitment Process by clicking here.****Check out DE Shaw Interview Questions here**

**DE SHAW Placement Pattern**

The DE Shaw Placement Questions that come in the Round 1 – online test of the recruitment process are created in a way that tests the candidate’s calculation, logical and analytical skills and also the verbal ability.

To clear the cut off of the DE Shaw placement questions test, you need to practice beforehand – **Practice Aptitude skills – Quantitative, Logical, Verbal. **The pattern for written test in DE Shaw campus recruitment is:

Section | Number of Questions | Allotted Time |
---|---|---|

Aptitude | 20 | 20 |

Technical | 20 | 20 |

Coding | 1 | 20 |

Total | 41 | 60 |

**The time allotted for the written exam is 60 minutes. There is a negative marking of 0.25 for each wrong answer in the paper.**

**D E SHAW Placement Papers Syllabus**

D E SHAW previous year papers give a gist of the syllabus from which most of the questions will be asked. The syllabus gives you an idea of what topics should be prepared.

On analyzing previous year D E SHAW papers, we found out topics from which D E SHAW mostly repeats its questions. The syllabus for D E SHAW aptitude section is as follows:

- Percentages
- Profit and Loss
- Permutation and Combination
- Probability
- Speed Time and Distance
- Boats and Streams
- Time and Work
- Data Interpretation
- Mixtures and Allegation

The coding questions are asked from concepts like dynamic programming, tree traversals etc. The technical programming MCQs were asked from the below topics.

- Data structures
- Networking
- DBMS
- Oops

**DE SHAW Placement Papers (Recently asked questions)**

Given below are some of the recently asked questions from DE SHAW placement papers. Practicing this will give you an idea about the type of questions asked.

**D E SHAW Placement Papers- Aptitude Questions**

- 139 members participated in a game. After each match, a team gets eliminated. What is the number of matches to be held to find the champion?

138

- A typist can type a matter in 2hours, while another typist takes 3 hours to complete the task. If they work together they will take how much time to finish the work?

1 hour 12 minutes

3. How many squares are there on an 8*8 chess board?

204

4. Find the next term in the given series: 12,6,6,9,18,?

45

- Two students appeared for an examination. The difference between their marks was 9. The one who secured the more marks had 56% of the total mark. Find their marks?

42 & 33

**For more practice questions on quants: PRACTICE QUANTS**

**DE SHAW Placement Papers – Technical & Coding Questions**

These are some of the previously asked DE Shaw Placement Questions

1) Given three arrays called sweetness, bitterness bad chocolate name. There is a boy who will eat the sweetest chocolate on the first day, if two chocolates have the same sweetness then the one with less bitterness value must be chosen. If two have the same sweetness and bitterness value then the name which comes lexicographically is chosen.

There is a query array which gives the day and we must return the name of the chocolate eaten in that day.

**For example:**

Sweetness array [2 3 7 3 2 2]

Bitterness array [5 4 1 4 9 3]

Chocolate name array [a b c d e f]

Query [3 5 1 2 6 4]

**Output:**

d a c b e f

2) Given a pile of coins, we must make all piles have an equal number of coins. We can either add or remove coins. It is not necessary to add the coins that are removed. Given the cost of adding and cost of removing, the minimum cost to equalize the array must be returned.

**Example:**

3 //number of piles

1 5 10

1 //cost of adding

1 //cost of removing

**Output:**

9

10

0 3 0 3 0 0 0 9 5 6 0

3

2

**Output:**

52

3) Given a string for example “abaabbaab”. We have to output the minimum cuts needed to make each of the substrings a palindrome.

- Here there is cut after the first character -> a baabbaab
- So the answer is 1

If the input is “ab”. a b. Output 1

If the input is “dad”. No cuts. Hence Output 0