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
Questions
Callback's practice questions and the LeetCode questions DE Shaw has been asking, filtered together.
Asked on LeetCode
116 questions · all time
- Merge Sorted ArrayeasyArrayTwo PointersSortingfrequency 37.0
- Minimum Size Subarray SummediumArrayBinary SearchSliding WindowPrefix Sumfrequency 37.0
- Number of Ways to Select BuildingsmediumStringDynamic ProgrammingPrefix Sumfrequency 37.0
- Number of Ways to Wear Different Hats to Each OtherhardArrayDynamic ProgrammingBit ManipulationBitmask+3frequency 37.0
- Open the LockmediumArrayHash TableStringBreadth-First Search+1frequency 37.0
- Palindrome PartitioningmediumStringDynamic ProgrammingBacktrackingfrequency 37.0
- Peak Index in a Mountain ArraymediumArrayBinary SearchTernary Searchfrequency 37.0
- Predict the WinnermediumArrayMathDynamic ProgrammingRecursion+3frequency 37.0
- Recover Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 37.0
- Remove Duplicate LettersmediumStringStackGreedyMonotonic Stackfrequency 37.0
- Remove Max Number of Edges to Keep Graph Fully TraversablehardUnion-FindGraph Theoryfrequency 37.0
- Shortest Path in a Grid with Obstacles EliminationhardArrayBreadth-First SearchMatrixfrequency 37.0
- Split Array Largest SumhardArrayBinary SearchDynamic ProgrammingGreedy+1frequency 37.0
- Two SumeasyArrayHash Tablefrequency 37.0
- Valid AnagrameasyHash TableStringSortingfrequency 37.0
- Wildcard MatchinghardStringDynamic ProgrammingGreedyRecursionfrequency 37.0