Last updated on October 9th, 2024 at 10:03 pm

This Leetcode problem Shortest Distance in a Line LeetCode Solution is done in SQL.

List of all LeetCode Solution

Shortest Distance in a Line LeetCode Solution

Problem Statement

Table point holds the x coordinate of some points on x-axis in a plane, which are all integers.

Write a query to find the shortest distance between two points in these points.

The shortest distance is ‘1’ obviously, which is from point ‘-1’ to ‘0’. So the output is as below:

Note: Every point is unique, which means there is no duplicates in the table point.

1. Shortest Distance in a Line LeetCode Solution MySQL

select 
  min(
    abs(a.x - b.x)
  ) as shortest 
from 
  point as a, 
  point as b 
where 
  a.x != b.x;