Regret Heap¶
Table of Contents¶
- 1642. Furthest Building You Can Reach (Medium)
- 630. Course Schedule III (Hard)
- 871. Minimum Number of Refueling Stops (Hard)
- 3362. Zero Array Transformation III (Medium)
- 2813. Maximum Elegance of a K-Length Subsequence (Hard)
- 3049. Earliest Second to Mark Indices II (Hard)
- 2599. Make the Prefix Sum Non-negative (Medium) 👑
1642. Furthest Building You Can Reach¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, greedy, heap priority queue
630. Course Schedule III¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, greedy, sorting, heap priority queue
871. Minimum Number of Refueling Stops¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, greedy, heap priority queue
3362. Zero Array Transformation III¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, greedy, sorting, heap priority queue, prefix sum
2813. Maximum Elegance of a K-Length Subsequence¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, stack, greedy, sorting, heap priority queue
3049. Earliest Second to Mark Indices II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, greedy, heap priority queue
2599. Make the Prefix Sum Non-negative¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, greedy, heap priority queue