DE Shaw Interview Questions, Process, and Tips

One Medium level greedy question was asked

Coding question was asked

Q1. Introduction of yoirself
Add your answer
Q2. Previous exoerience
Add your answer

There were 2 Questions in the Hackerrank Test
1. DP (Leetcode Hard)
2. Arrays (Medium)

Was able to solve almost 1 Question Completely, Second question with 80% Test Cases.

Q1. Arrays Medium (Increasing Triplet Subsequence - Leetcode )
Add your answer
Q2. DP Hard ( Minimum Steps to Delete a String by deleting substring comprising of same characters - GFG)
Ans. 
The problem involves finding the minimum steps to delete a substring comprising of same characters from a given string.
• Use dynamic programming to keep track of the minimum steps required to delete substrings.

• Iterate through the string and check for substrings with same characters.

• Update the DP array with the minimum steps required to delete the substring.
Answered by AI
Add your answer

Q1. When have you solved a problem
Add your answer

Quant, reasoning, cs fundamentals

1 hour- data interpretation

Simple topic for freshers.

The topic for coding test was from graph and dynamic programming, questions where from medium to hard level.

Q1. The questions where pure Data structure and Algorithm's. They asked about implementation of linked list, questions based on BST, recursion on array.
Add your answer
Q2. Implementation of stack and queue
Ans. 
Stack and queue can be implemented using arrays or linked lists. Stack follows LIFO while queue follows FIFO.
• Stack can be implemented using arrays with push and pop operations.

• Queue can be implemented using arrays with enqueue and dequeue operations.

• Both stack and queue can also be implemented using linked lists for dynamic size.

• Example: Implementing a stack using an array in C++

• Example: Implementing a queue using a li
Answered by AI
Add your answer
Q3. Find middle element of LinkedList
Ans. 
To find the middle element of a LinkedList, use two pointers - one moving at double the speed of the other.
• Initialize two pointers, slow and fast, at the head of the LinkedList.

• Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the LinkedList.

• The element pointed to by the slow pointer at this point will be the middle element.
Answered by AI
Add your answer
Q4. Implementation of BST
Ans. 
BST (Binary Search Tree) is a data structure where each node has at most two children, with left child being less than parent and right child being greater.
• BST is used for efficient searching, insertion, and deletion of elements.

• In-order traversal of BST gives elements in sorted order.

• Example: Inserting elements 5, 3, 8, 1, 4 into a BST would result in a tree with root 5, left child 3, right child 8, and left child of
Answered by AI
Add your answer
Q5. Recursion on array
Ans. 
Recursively iterate through an array of strings
• Use a base case to stop the recursion

• Pass a smaller portion of the array in each recursive call

• Concatenate or manipulate the strings as needed
Answered by AI
Add your answer