LeetCode Experience

#373 Find K Pairs with Smallest Sums

SWE coding Medium

Sign in to bookmark Original →

Interview Experience

LeetCode #373: Find K Pairs with Smallest Sums. Difficulty: Medium. Topics: Array, Heap (Priority Queue). Asked at Google 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

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Heap Questions →