codejeet
Blog
Tracker
System Design
Home
/
Companies
/
DE Shaw
/
Heap Priority Queue
DE Shaw Heap Priority Queue Questions
11 heap priority queue problems asked at DE Shaw interviews
Easy (1)
Medium (4)
Hard (6)
Questions
Title
Difficulty
Acceptance
Frequency
Maximum Subsequence Score
Medium
54.6%
79.1%
Take Gifts From the Richest Pile
Easy
75.5%
73.2%
Query Kth Smallest Trimmed Number
Medium
47.1%
73.2%
Minimum Number of Refueling Stops
Hard
41.1%
57.7%
Reorganize String
Medium
56.8%
52.7%
Sliding Window Maximum
Hard
48.5%
52.7%
Furthest Building You Can Reach
Medium
50.7%
46.3%
Put Marbles in Bags
Hard
72.2%
46.3%
Maximum Performance of a Team
Hard
47.7%
37.4%
Minimum Number of Visited Cells in a Grid
Hard
23.6%
37.4%
Minimum Cost to Make at Least One Valid Path in a Grid
Hard
70.9%
37.4%
Showing 11 questions
All DE Shaw Questions
All Heap Priority Queue Questions