Choose K Elements With Maximum Sum (LeetCode 3478)
MediumLeetCode 3478 · Scheduling & Greedy with Heap · Bloomberg · 40:57Choose K Elements With Maximum Sum · Brute Force · Optimal Leetcode 3478My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 3478 Choose K Elements With Maximum Sum by codestorywithMIK: Heap / Priority Queue, Medium. Topics: Array, Sorting, Heap (Priority Queue). Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Sorting, Heap (Priority Queue)
- Patterns
- Scheduling & Greedy with Heap
- Asked at
- Bloomberg
- Chapter
- Heap / Priority Queue
- Duration
- 40:57
Related problems
- Sort Characters By Frequency (LeetCode 451)
- Remove Stones to Minimize the Total (Google, Miscrosoft, Netflix, Meta) : Explanation ➕ Live Coding (LeetCode 1962)
- Single-Threaded CPU (LeetCode 1834)
- Last Stone Weight (LeetCode 1046)
- Maximum Subsequence Score (LeetCode 2542)
- Total Cost to Hire K Workers (LeetCode 2462)
- Reorganize String (LeetCode 767)
- Task Scheduler (LeetCode 621)