De-Shaw Logo

De-Shaw - Depth-First Search

Depth-First Search questions asked by De-Shaw

Total: 7
Easy: 0
Medium: 5
Hard: 2
Progress: 0%
No. Question Title Link Difficulty Solved
1 Minimum Number of Pushes to Type Word II Visit Medium
2 Sum of Subarray Ranges Visit Medium
3 Minimum Cost to Make at Least One Valid Path in a Grid Visit Hard
4 Minimum Number of Refueling Stops Visit Hard
5 Flatten Nested List Iterator Visit Medium
6 Restricted Restricted Hard
7 Restricted Restricted Hard
8 Restricted Restricted Hard
9 Restricted Restricted Hard
10 Restricted Restricted Hard
11 Restricted Restricted Hard
12 Restricted Restricted Hard
13 Restricted Restricted Hard
14 Restricted Restricted Hard
15 Restricted Restricted Hard

Log in to access all 7 questions for free!

Log In

Frequently Asked Questions

Common questions about De-Shaw interviews