Range Sum of Sorted Subarray Sums (LeetCode 1508)
MediumLeetCode 1508 · Scheduling & Greedy with Heap · Google, Bloomberg · 35:31Range Sum of Sorted Subarray Sums · Learning Something New · Leetcode 1508My 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 1508 Range Sum of Sorted Subarray Sums by codestorywithMIK: Heap / Priority Queue, Medium. Topics: Array, Two Pointers, Binary Search, Sorting. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Two Pointers, Binary Search, Sorting, Prefix Sum
- Patterns
- Scheduling & Greedy with Heap
- Chapter
- Heap / Priority Queue
- Duration
- 35:31
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)