Skip to content
    SeaCode
    Learning tracksCode ArenaWorkshops & EventsInstructors
    Log inSign up
    Practice problems / K closest points to the origin

    K closest points to the origin

    Mediumheapsortinggeometry

    Return the k points closest to (0, 0) (straight-line distance), ordered from nearest to farthest; break ties by smaller x, then smaller y.

    Example 1

    Input:  points = [[1,3],[-2,2]], k = 1
    Output: [[-2,2]]

    Example 2

    Input:  points = [[3,3],[5,-1],[-2,4]], k = 2
    Output: [[3,3],[-2,4]]

    Constraints

    • 1 ≤ k ≤ points.length ≤ 10⁴
    • -10⁴ ≤ x, y ≤ 10⁴

    Submit checks your solution against 7 tests, including hidden ones.

    /**
     * @param {int[][]} points
     * @param {int} k
     * @return {int[][]}
     */
    function kClosest(points, k) {
      
    }
    
    Sign in to run
    SeaCode

    Learn to code for real, online or at our branch in front of Cairo University, Giza.

    Learn

    • All courses
    • Interactive tutorials
    • Interview practice problems
    • Mock interview
    • Learning tracks
    • Code Arena
    • Workshops & Events
    • Knowledge library
    • Team projects

    Your account

    • Log in
    • Sign up
    • Learning plan
    • Certificates
    • Site map

    Contact us

    • WhatsApp
    • 010 9094 1104
    • In front of Cairo University, Giza

    © 2026 SeaCode. All rights reserved.