De-Shaw Logo

De-Shaw - Heap (Priority Queue)

Heap (Priority Queue) questions asked by De-Shaw

Total: 8
Easy: 0
Medium: 5
Hard: 3
Progress: 0%
No. Question Title Link Difficulty Solved
1 Maximum Number of Subsequences After One Inserting Visit Medium
2 Maximum Points Tourist Can Earn Visit Medium
3 Number of Subarrays With AND Value of K Visit Hard
4 Using a Robot to Print the Lexicographically Smallest String Visit Medium
5 Shortest Subarray to be Removed to Make Array Sorted 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 8 questions for free!

Log In

Frequently Asked Questions

Common questions about De-Shaw interviews