How hard is LeetCode 2777. Date Range Generator?

LeetCode 2777. Date Range Generator is rated Medium on LeetCode.

What is the time complexity of LeetCode 2777. Date Range Generator?

The Python solution on this page runs in O(k), where k is the number of yielded dates.

What is the space complexity of LeetCode 2777. Date Range Generator?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 2777. Date Range Generator cover?

LeetCode 2777. Date Range Generator is tagged JavaScript on LeetCode.

Is LeetCode 2777. Date Range Generator a premium problem?

Yes. LeetCode 2777. Date Range Generator is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

MediumNo. 2777LeetCode Premium

Date Range Generator — LeetCode 2777 Python Solution

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

The problem

Given a start date start, an end date end, and a positive integer step, return a generator object that yields dates in the range from start to end inclusive. The value of step indicates the number of days between consecutive yielded values.

Example

Input: start = "2023-04-01", end = "2023-04-04", step = 1
Output: ["2023-04-01","2023-04-02","2023-04-03","2023-04-04"]
Explanation: const g = dateRangeGenerator(start, end, step);

Python solution

PythonSolution

from datetime import date, timedelta


def dateRangeGenerator(start: str, end: str, step: int):
    cur = date.fromisoformat(start)
    last = date.fromisoformat(end)
    delta = timedelta(days=step)
    while cur <= last:
        yield cur.isoformat()
        cur += delta

Complexity

Time: O(k)where k is the number of yielded dates
Space · auxiliary: O(1)

Related problems
No.	Problem	Difficulty
2778	Sum of Squares of Special Elements	Easy
0057	Insert Interval	Medium
0192	Word Frequency	Medium
0193	Valid Phone Numbers	Easy
0194	Transpose File	Medium
0195	Tenth Line	Easy

Frequently asked questions

How hard is LeetCode 2777. Date Range Generator?: LeetCode 2777. Date Range Generator is rated Medium on LeetCode.
What is the time complexity of LeetCode 2777. Date Range Generator?: The Python solution on this page runs in O(k), where k is the number of yielded dates.
What is the space complexity of LeetCode 2777. Date Range Generator?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2777. Date Range Generator cover?: LeetCode 2777. Date Range Generator is tagged JavaScript on LeetCode.
Is LeetCode 2777. Date Range Generator a premium problem?: Yes. LeetCode 2777. Date Range Generator 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