Data Structures
priority queue
20 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | greedy algorithm sorting array +1 more | 25.8% | hard |
2 | priority queue heap data modeling | 15.1% | Med. |
3 | sliding window priority queue array +1 more | 32.2% | hard |
4 | greedy algorithm priority queue linked list +2 more | 32.2% | hard |
5 | top k elements priority queue array +1 more | 63.5% | easy |
6 | top k elements sorting array +2 more | 42.7% | easy |
7 | priority queue heap k-way merge +3 more | 25.0% | easy |
8 | greedy algorithm priority queue heap | 52.7% | easy |
9 | top k elements hash map priority queue +1 more | 55.9% | Med. |
10 | sorting counting hash map +2 more | 80.4% | Med. |
11 | heap priority queue top k elements +2 more | 52.7% | Med. |
12 | sorting priority queue array +1 more | 51.2% | Med. |
13 | top k elements greedy algorithm heap +3 more | 44.4% | hard |
14 | stack hash map priority queue +2 more | 40.0% | hard |
15 | linked list k-way merge sorting +2 more | 84.3% | Med. |
16 | k-way merge priority queue sorting +1 more | 64.5% | Med. |
17 | greedy algorithm heap k-way merge +1 more | 44.1% | hard |
18 | priority queue k-way merge array +2 more | 31.4% | hard |
19 | k-way merge priority queue sorting +1 more | 42.3% | hard |
20 | merge intervals heap sorting +2 more | 22.5% | Med. |