Data Structures
heap
12 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | priority queue heap data modeling | 15.1% | Med. |
2 | greedy algorithm priority queue linked list +2 more | 32.2% | hard |
3 | top k elements sorting array +2 more | 42.7% | easy |
4 | priority queue heap k-way merge +3 more | 25.0% | easy |
5 | greedy algorithm priority queue heap | 52.7% | easy |
6 | heap priority queue top k elements +2 more | 52.7% | Med. |
7 | top k elements greedy algorithm heap +3 more | 44.4% | hard |
8 | linked list k-way merge sorting +2 more | 84.3% | Med. |
9 | k-way merge priority queue sorting +1 more | 64.5% | Med. |
10 | greedy algorithm heap k-way merge +1 more | 44.1% | hard |
11 | k-way merge priority queue sorting +1 more | 42.3% | hard |
12 | merge intervals heap sorting +2 more | 22.5% | Med. |