DSA Visualizations | Hello Interview

Limited Time Offer:30% off Hello Interview Premium 🎉

30% off Hello Interview Premium 🎉

Back to Main

Learn DSA

Introduction

Two Pointers

Overview

Container With Most Water

3-Sum

Triangle Numbers

Move Zeroes

Sort Colors

Trapping Rain Water

Sliding Window

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Intervals

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Stack

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Overview

Daily Temperatures

Largest Rectangle in Histogram

Linked List

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Binary Search

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Heap

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Breadth-First Search

Introduction

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Backtracking

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Graphs

Overview

Course Schedule

Course Schedule II

Dynamic Programming

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Greedy Algorithms

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Trie

Overview

Implement Trie Methods

Prefix Matching

Prefix Sum

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Matrices

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Pricing

Become a Coach

Pricing Become a Coach

Get Premium

Kth Largest Element in an Array

Find K Closest Elements

K Closest Points to Origin

DESCRIPTION (credit Leetcode.com)

Given a list of points in the form [[x₁, y₁], [x₂, y₂], ... [x_n, y_n]] and an integer k, find the k closest points to the origin (0, 0) on the 2D plane.

The distance between two points (x, y) and (a, b) is calculated using the formula:

√(x₁ - a₂)² + (y₁ - b₂)²

Return the k closest points in any order.

Example 1:

Inputs:


points = [[3,4],[2,2],[1,1],[0,0],[5,5]]
k = 3

Output:


[[2,2],[1,1],[0,0]]

Also valid:


[[2,2],[0,0],[1,1]]
[[1,1],[0,0],[2,2]]
[[1,1],[2,2],[0,0]]
...
[[0,0],[1,1],[2,2]]

💻 Desktop Required

The code editor works best on larger screens. Please open this page on your computer to write and run code.

"Write a function that takes a list of points represented as `points` and an integer `k`, and returns the `k` closest points to the origin (0, 0). The distance between two points on a plane is calculated using the Euclidean distance formula."

Run your code to see results here

Have suggestions or found something wrong?

Explanation

Approach 1: Sorting

The simplest approach is to sort calculate the distance of each point from the origin and sort the points based on their distance. This approach has a time complexity of O(n log n) where n is the number of points in the array, and a space complexity of O(n) (to store the sorted array of distances).

Approach 2: Min Heap

This problem can be solved using a similar approach to the one used to solve Kth Largest Element in an Array. They key difference is that we need to store the k closest points to the origin, rather than the k largest elements. Since we are looking for the k smallest elements, we need a max-heap, rather than a min-heap.

By default, python's heapq module implements a min-heap, but we can make it behave like a max-heap by negating the values of everything we push onto it.

We add the first k points to the heap by pushing a tuple containing the negative of the distance from the origin, and the index of the point. After that is finished, our heap contains the k closest points to the origin that we've seen so far, with the point furthest from the origin at the root of the heap.

k = 3


import heapq

def k_closest(points, k):
  heap = []
  for i in range(len(points)):
    x, y = points[i]
    distance = x * x + y * y

    if len(heap) < k:
      heapq.heappush(heap, (-distance, i))
    elif distance < -heap[0][0]:
      heapq.heappushpop(heap, (-distance, i))

  return [points[p[1]] for p in heap]

initialize heap

0 / 6

Pushing the first k = 3 elements onto the heap. The root of the heap after this is done holds a tuple containing the negative of the distance of the point furthest from the origin, and the index of that point (-25, 0).

For each point after the first k, we calculate the distance from the origin and compare it with the root of the heap. If the current point is closer to the origin than the root of the heap, we pop the root and push the current point into the heap. This way, the heap will always contain the k closest points to the origin we've seen so far.

k = 3


import heapq

def k_closest(points, k):
  heap = []
  for i in range(len(points)):
    x, y = points[i]
    distance = x * x + y * y

    if len(heap) < k:
      heapq.heappush(heap, (-distance, i))
    elif distance < -heap[0][0]:
      heapq.heappushpop(heap, (-distance, i))

  return [points[p[1]] for p in heap]

push to heap

0 / 2

At the end of the iteration, the heap will contain the k closest points to the origin. We can iterate over each point in the heap and return the point associated with each tuple.

k = 3


import heapq

def k_closest(points, k):
  heap = []
  for i in range(len(points)):
    x, y = points[i]
    distance = x * x + y * y

    if len(heap) < k:
      heapq.heappush(heap, (-distance, i))
    elif distance < -heap[0][0]:
      heapq.heappushpop(heap, (-distance, i))

  return [points[p[1]] for p in heap]

distance = 50

0 / 1

Solution


import heapq

def k_closest(points, k):
  heap = []
  for i in range(len(points)):
    x, y = points[i]
    distance = x * x + y * y

    if len(heap) < k:
      heapq.heappush(heap, (-distance, i))
    elif distance < -heap[0][0]:
      heapq.heappushpop(heap, (-distance, i))

  return [points[p[1]] for p in heap]

k closest points to origin

0 / 11

Complexity Analysis

Time Complexity: O(n log k). We iterate over all the points in the array. Comparing the current point with the root of the heap takes O(1) time. In the worst case, we both push and pop each point from the heap, which takes O(log k) time.

Space Complexity: O(k). The space used by the heap to store the k closest points to the origin.

Next: Find K Closest Elements

Your account is free and you can post anonymously if you choose.

Sort By

K Closest Points to Origin

DESCRIPTION (credit Leetcode.com)

💻 Desktop Required

Explanation

Approach 1: Sorting

Approach 2: Min Heap

Solution

Complexity Analysis

Questions

Learn

Links

Legal

Contact