Find K Pairs with Smallest Sums (LeetCode 373) – Part 2
MediumLeetCode 373 · K-way Merge · Google, Amazon +8 · 20:12Find K Pairs with Smallest Sums · OPTIMAL · GOOGLE · Leetcode-373 · Live CodeMy 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 (part 2 of 2) for LeetCode 373 Find K Pairs with Smallest Sums by codestorywithMIK: Heap / Priority Queue, Medium. Topics: Array, Heap (Priority Queue). Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Heap (Priority Queue)
- Patterns
- K-way Merge
- Chapter
- Heap / Priority Queue
- Duration
- 20:12