Tag Archives: D-E-Shaw

D E Shaw Interview | Set 5 (On-Campus for Internship)

Recently D.E Shaw visited our campus for internship and placements. They shortlisted 16 students out of 200 students on the basis of resume. Telephonic Interview… Read More »

D E Shaw Interview | Set 4 (On-Campus for Internship)

D. E. Shaw recently carried out intern procedure in our college. The whole process had three rounds. Round 1: It was CV shortlisting. Out of… Read More »

Print all nodes that don’t have sibling

Given a Binary Tree, print all nodes that don’t have a sibling (a sibling is a node that has same parent. In a Binary Tree,… Read More »

D E Shaw Interview | Set 3

Round 1 : (Telephonic Interview) (45 mins) 1. Tell me about yourself. 2. OOPS Concepts like abstraction, encapsulation and examples for each. 3. Polymorphism –… Read More »

D E Shaw Interview | Set 2

Type : Off campus (Bangalore) (0-1 yr experience) Role : Software Developer @ Hyderabad campus Duration : 2 Days Total Candidates : ~200 Split Up… Read More »

Interview Experiences at D. E. Shaw & Co.

I had three rounds: My first round was telephonic interview and it lasted for about an hour and the questions covered entire breadth of core… Read More »

D E Shaw Interview | Set 1

Total 3 rounds. 1st written followed by 2 face to face and every round was ELIMINATION one. 1st Round: Written (1hr) 3 sections. 20 min… Read More »

Program to find amount of water in a given glass

There are some glasses with equal capacity as 1 litre. The glasses are kept as follows: 1 2 3 4 5 6 7 8 9… Read More »

Implement Stack using Queues

The problem is opposite of this post. We are given a Queue data structure that supports standard operations like enqueue() and dequeue(). We need to… Read More »

Find the number of islands | Set 1 (Using DFS)

Given a boolean 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 5… Read More »

Find the largest BST subtree in a given Binary Tree | Set 1

Given a Binary Tree, write a function that returns the size of the largest subtree which is also a Binary Search Tree (BST). If the… Read More »

Trie | (Insert and Search)

Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length). If we store keys in… Read More »

Print a given matrix in spiral form

Given a 2D array, print it in spiral form. See the following examples. Examples: Input: 1 2 3 4 5 6 7 8 9 10… Read More »

A Product Array Puzzle

Given an array arr[] of n integers, construct a Product Array prod[] (of same size) such that prod[i] is equal to the product of all… Read More »

Intersection of two Sorted Linked Lists

Given two lists sorted in increasing order, create and return a new list representing the intersection of the two lists. The new list should be… Read More »