Top K Closest Pairs in a Sorted Array

apple

Given a non-decreasing sorted integer array nums and an integer k, return the k pairs with the smallest distances among all index pairs (i, j) where 0 <= i < j < n.

The distance is:

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: