D. E. Shaw (1+ Interviews) | Interview Experiences

Summary

I recently interviewed with D. E. Shaw for the Quality and Test Engineer (QTE) position, where I discussed core C++ concepts and solved several Data Structures & Algorithms problems, specifically focusing on Dynamic Programming and String manipulation questions.

Full Experience

I recently had the opportunity to interview with D. E. Shaw for the Quality and Test Engineer (QTE) position. Interview Highlights:

1)intro 2)Project Discussion

Core C++ Concepts: Deep dive into maps vs unordered maps, time complexities, memory management, and multithreading basics.

DSA problems were based on the following concept Dynamic Programming: https://leetcode.com/problems/max-points-on-a-line https://leetcode.com/problems/scramble-string?envType=problem-list-v2&envId=dynamic-programming

String Problems: https://leetcode.com/problems/trapping-rain-water https://leetcode.com/problems/longest-palindromic-substring

Interview Questions (5)

Core C++ Concepts: Maps vs Unordered Maps, Memory, Multithreading

Other

Deep dive into maps vs unordered maps, time complexities, memory management, and multithreading basics.

Max Points on a Line

Data Structures & AlgorithmsHard

Given an array of points, find the maximum number of points that lie on the same straight line.

Scramble String

Data Structures & AlgorithmsHard

Given two strings s1 and s2 of the same length, determine if s2 is a scrambled string of s1.

Trapping Rain Water

Data Structures & AlgorithmsHard

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Longest Palindromic Substring

Data Structures & AlgorithmsMedium

Given a string s, return the longest palindromic substring in s.

D. E. Shaw Interviews

Summary

Full Experience

Interview Questions (5)

Have a D. E. Shaw Interview Experience to Share?