DE Shaw Technical Engineer Interview Questions and Answers

Q1. How does internet works
Add your answer
Q2. HTTP codes SQL troubleshooting
Add your answer

Q1. SQL python java
Add your answer

Q1. Salary negotiations
Add your answer
Q2. Work shifts questions
Add your answer

Q1. Find the last 2 row in sql?
Add your answer

Q1. Clustering in cassendra
Ans. 
Clustering in Cassandra involves grouping together multiple nodes to improve performance, scalability, and fault tolerance.
• Clustering is used to distribute data across multiple nodes in a Cassandra cluster.

• It helps in achieving high availability and fault tolerance by replicating data across nodes.

• Cassandra uses consistent hashing to determine which node will store a particular piece of data.

• Data is partitioned into sm...read more
Answered by AI
Add your answer
Q2. Cloud Deployment strategies
Add your answer

Number of islands in a matrix

Design data recovery system

Q1. Questions were mostly around system design, you will be given a case like a stock system and specific use case is asked to design end to end from UI to backend.
Add your answer
Q2. Some of the system debugging/performance improvement questions are asked from both UI and backend.
Add your answer

20 questions on logical and mathematical

Q1. Puzzles and coding questions
Add your answer

Q1. Design Principles
Add your answer

Q1. Implement minstack
Add your answer
Q2. How load balancers work
Ans. 
Load balancers distribute incoming network traffic across multiple servers to ensure no single server is overwhelmed.
• Load balancers monitor the health of servers and distribute traffic based on predefined algorithms.

• They can be hardware-based or software-based.

• Common algorithms used by load balancers include round-robin, least connections, and IP hash.

• Load balancers can improve reliability and scalability of a website ...read more
Answered by AI
Add your answer

Q1. 2 sum problem to implement in O(n)
Ans. 
The Two Sum problem involves finding two numbers in an array that add up to a target value.
• Iterate through the array and store the difference between the target and current element in a hashmap.

• Check if the current element exists in the hashmap, if yes, return the indices of the current element and the stored difference.

• Time complexity of O(n) can be achieved by using a hashmap to store elements and their indices.
Answered by AI
Add your answer
Q2. About the projects i have done
Add your answer