LeetCode Experience

#373 Find K Pairs with Smallest Sums

Interview Experience

LeetCode #373: Find K Pairs with Smallest Sums. Difficulty: Medium. Topics: Array, Heap (Priority Queue). Asked at LinkedIn in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Heap (Priority Queue) Arrays Heap Queue