De Shaw Interview Experience | Set 1

Company Name: De Shaw

Job Role: Technology Development intern

Years of Experience Required: 0

Drive: On-campus

CTC: 1,50,000Rs/month + accommodation and flight tickets(Subject to covid situation)

Preparation for DE Shaw

Topics: Dsa, OOPs, Competitive Programming

Duration: 1 year

Source of Preparation: Codeforces, love Babbar DSA sheet, Interview bit, Coding Ninjas, and geeks for geeks interview experience section.


Interview Rounds

Round 1: Online Coding Test

Problem List:

Problem 1: You are in a room with N lights. Some of them are on and some of them are off.You cannot turn on the lights if they are off initially. if an odd number of lights are on then the room will be lightened else there will be dark. Calculate the number of ways to lighten the room.[Easy]


Input Format: N = 5, array[] = {1,0,1,0,1}

Result: 4

Case 1: We do not off any of the lights{1,0,1,0,1}
Case 2: We off lights in pair {0,0,0,0,1},{0,0,1,0,0},{1,0,0,0,0}

Problem 2: I don’t remember the exact question but it was hard. The question needs to be solved using 3d DP. [Hard]

Round 2: Video Call.

Topics asked: Dp, oops

Non Coding Problems:

  • What is a class?
  • What is a object?
  • What is a constructor?
  • How many types of constructor are there, What is a copy constructor, Can we create our own copy constructor, How many types of copies are possible using copy constructor?
  • What is the difference between shallow copy and deep copy, When one should create deep copy and shallow copy?
  • What is abstraction, What is inheritance, Types of inheritance and brief about all of them?
  • What is polymorphism, types of polymorphism?
  • Difference between overloading and overriding?
  • What is virtual function, How are virtual functions executed?
  • What are vTable and Vpointers, explain through examples.
  • What are hashmaps, how they are implemented, What is difference between open addressing and chaining with examples?
  • Write a program to print “Hello World” and explain what is cout is and how does it works.

Coding Problem: Find the maximum sum of matrix size CxC in a given matrix of size NxM.

Round 2: Video Call.

Topics asked: Dp, OOPs, linked list


  1. LRU Cache in O(N). I knew this question beforehand but my solution was O(NlogN) where N is the number of queries but after discussion and hints by interviewers I was able to come up with an O(N) Solution.
  2. 3d Dp hard problem from leetcode.

Verdict: Selected

Just Focus on DSA, OOPs, and cp for on-campus placement, internships.