SDE - Intern
DE Shaw India
2 rounds | 3 Coding problems
1046 views
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
01
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.

view more

##### For example:
``The given linked list is 1 -> 2 ->...``
view more
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

02
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.

view more
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

Similar interview experiences
SDE - 1
4 rounds | 7 problems
Interviewed by DE Shaw India
6389 views
SDE - Intern
2 rounds | 3 problems
Interviewed by DE Shaw India
388 views
SDE - 1
2 rounds | 4 problems
Interviewed by DE Shaw India
136 views
SDE - 1
3 rounds | 10 problems
Interviewed by DE Shaw India
247 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16882 views