How hard is LeetCode 613. Shortest Distance in a Line?

LeetCode 613. Shortest Distance in a Line is rated Easy on LeetCode.

What topics does LeetCode 613. Shortest Distance in a Line cover?

LeetCode 613. Shortest Distance in a Line is tagged Database on LeetCode.

Is LeetCode 613. Shortest Distance in a Line a premium problem?

Yes. LeetCode 613. Shortest Distance in a Line is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

EasyNo. 0613LeetCode Premium

Shortest Distance in a Line — LeetCode 613 Python Solution

Topics: Database
Reading time: 2 min
Source: leetcode.com

The problem

Report the shortest distance between any two distinct points on the X axis, in a column named shortest. The Point table has one row per point: x (int, the primary key and the coordinate of the point on the X axis).

Example

Point table:

| x  |
| -- |
| -4 |
| 1  |
| 3  |
| 10 |

Result:

| shortest |
| -------- |
| 2        |

Sorted, the gaps are 5, 2 and 7, so the closest pair is 1 and 3 at a distance of 2.

Python solution

PythonSolution

import pandas as pd

def shortest_distance(point: pd.DataFrame) -> pd.DataFrame:
    xs = point['x'].sort_values().to_numpy()
    gaps = xs[1:] - xs[:-1]
    return pd.DataFrame({'shortest': [int(gaps.min())]})

Complexity

Time: O(n log n)(typical)
Space · auxiliary: O(n)

Related problems
No.	Problem	Difficulty
0610	Triangle Judgement	Easy
0608	Tree Node	Medium
0607	Sales Person	Easy
0619	Biggest Single Number	Easy
0620	Not Boring Movies	Easy
0175	Combine Two Tables	Easy

Frequently asked questions

How hard is LeetCode 613. Shortest Distance in a Line?: LeetCode 613. Shortest Distance in a Line is rated Easy on LeetCode.
What topics does LeetCode 613. Shortest Distance in a Line cover?: LeetCode 613. Shortest Distance in a Line is tagged Database on LeetCode.
Is LeetCode 613. Shortest Distance in a Line a premium problem?: Yes. LeetCode 613. Shortest Distance in a Line is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Download for Mac Download for Windows

Free to download. Check it runs on your machine, then pick a plan.

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 Terra

Transcribing...

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

Primary display

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

The problem

Example

Python solution

Complexity

Related problems

Frequently asked questions

Stuck on problems like this in a live interview?

Approach

Approach

Approach