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 | 力扣

• Tags: Array, Greedy, Heap Priority Queue

630. Course Schedule III

• LeetCode | 力扣

• Tags: Array, Greedy, Sorting, Heap Priority Queue

871. Minimum Number of Refueling Stops

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Greedy, Heap Priority Queue

3362. Zero Array Transformation III

• LeetCode | 力扣

• Tags: Array, Greedy, Sorting, Heap Priority Queue, Prefix Sum

2813. Maximum Elegance of a K-Length Subsequence

• LeetCode | 力扣

• Tags: Array, Hash Table, Stack, Greedy, Sorting, Heap Priority Queue

3049. Earliest Second to Mark Indices II

• LeetCode | 力扣

• Tags: Array, Binary Search, Greedy, Heap Priority Queue

2599. Make the Prefix Sum Non-negative 👑

• LeetCode | 力扣

• Tags: Array, Greedy, Heap Priority Queue