DE Shaw
Analytically demanding loops — probability, combinatorics, and algorithms, with a clear preference for candidates who reason precisely under pressure.
Typical loop
- 1Recruiter screen
- 2Online assessment: math and coding
- 3Phone screen: probability and algorithms
- 4Onsite: multiple quantitative and coding rounds
- 5Final round with the group you would join
Asked on LeetCode
All 116 by time range →- Binary Tree CamerashardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 100.0
- Find Minimum Cost to Remove Array ElementsmediumArrayDynamic Programmingfrequency 87.0
- Maximum Number of Subsequences After One InsertingmediumStringDynamic ProgrammingGreedyPrefix Sumfrequency 83.1
- Minimum Number of Taps to Open to Water a GardenhardArrayDynamic ProgrammingGreedyfrequency 78.5
- Minimum Size Subarray in Infinite ArraymediumArrayHash TableSliding WindowPrefix Sumfrequency 76.7
- Letter Combinations of a Phone NumbermediumHash TableStringBacktrackingfrequency 74.7
- Maximum Points After Collecting Coins From All NodeshardArrayDynamic ProgrammingBit ManipulationTree+3frequency 74.7
- Maximum Points Tourist Can EarnmediumArrayDynamic ProgrammingMatrixfrequency 74.7