DE Shaw Interview Questions, Process, and Tips

Quant, reasoning, cs fundamentals

1 hour- data interpretation

Simple topic for freshers.

Mostly logical CAT type ques. timed

Q1. Quantitative Puzzles
Add your answer

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

A coding round in hackerRank where, I got some aptitude and technical questions and two coding questions i solved one and half. One easy and one medium level.

There was again a coding test with only two questions of coding in hackerRank platform.

Q1. This round was a technical round and happened in hackerRank platform 2 basics coding questions.
Add your answer

Q1. This round was also almost same two coding questions both were easy medium level with some testing OS and Networking question as mcq.
Add your answer

Q1. This was more basic as the interview was very short and he just asked two coding questions.
Add your answer

Q1. One coding question was asked this was medium level.
Add your answer
Q2. One test case where have to list the test cases for Google pay app, like what are the test failure cases or what you test if you're a tester pf gpay app.
Add your answer

Q1. Basic questions.
Add your answer