De Shaw Interview Experience by bhupendra

New update is available. Click here to update.

SDE - Intern

DE Shaw India

2 rounds | 3 Coding problems

bhupendra

Fresher | Aug 2020

Selected

1046 views

1 comments

4 upvotes

Interview preparation journey

Preparation

Duration: 8 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, graphs, trees

Tip

Tip 1 : Practice more.
Tip 2 : Solve questions on Coding ninjas and Leetcode.
Tip 3 : Make good projects.

Application process

Where: Campus

Eligibility: Above 7 cgpa, branch-cse or ece

Resume tip

Tip 1 : Keep it short.
Tip 2 : Mention your projects in brief.

Interview rounds

Round

Medium

Online Coding Interview

Duration75 minutes

Interview date4 Aug 2020

Problems2

Check BST

Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false otherwise.

Try solving now

Reverse Linked List

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:

The given linked list is 1 -> 2 ->...

Problem approach

Maintain three pointers next, curr, previous and at every stage make prev=curr, curr=next and next=next->next
At the end when null occurs, make curr as head and return head

Try solving now

Round

Medium

Video Call

Duration45 minutes

Interview date10 Aug 2020

Problems1

Validate BST

Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false otherwise.

Problem approach

Maintain three pointers next, curr, previous and at every stage make prev=curr, curr=next and next=next->next
At the end when null occurs, make curr as head and return head

Try solving now