Arrays or Linked Lists Algorithm | Dataford Interview Questions

Shopee's checkout interface receives delivery windows from multiple logistics providers. Given a list of time intervals, merge every overlapping or directly adjacent window so the UI can display a compact schedule.

Formal Specification

Implement merge_delivery_windows(intervals). The input is a list of integer pairs [start, end], where start <= end. Return a new list of non-overlapping intervals sorted by start time. Two intervals should be merged when the next interval starts at or before the current interval's end. Do not modify the input list.

Constraints

0 <= intervals.length <= 10^5
Each interval contains exactly two integers
-10^9 <= start <= end <= 10^9
The input list must not be modified
The output must be sorted and non-overlapping

Function Signature

def merge_delivery_windows(intervals):

Your question is Arrays or Linked Lists Algorithm. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Formal Specification

Constraints

0 <= intervals.length <= 10^5
Each interval contains exactly two integers
-10^9 <= start <= end <= 10^9
The input list must not be modified
The output must be sorted and non-overlapping

Function Signature

def merge_delivery_windows(intervals):

Your question is Arrays or Linked Lists Algorithm. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.