Merge Overlapping Shifts | Dataford Interview Questions

Given a list of construction shifts with overlapping times, write a function to merge overlapping shifts and calculate total billable hours.

Represent each shift as [start, end], where both values are numeric hours and start < end. Return a tuple containing the merged shifts in chronological order and the total billable hours. Treat touching shifts, such as [1, 3] and [3, 5], as mergeable.

Constraints

0 <= shifts.length <= 1000
Each shift contains exactly two numeric values, [start, end]
start < end for every shift
Shift times may be integers or fractional hours
Return merged intervals in chronological order

Function Signature

def merge_shifts(shifts):

Your question is Merge Overlapping Shifts. 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

Given a list of construction shifts with overlapping times, write a function to merge overlapping shifts and calculate total billable hours.

Constraints

0 <= shifts.length <= 1000
Each shift contains exactly two numeric values, [start, end]
start < end for every shift
Shift times may be integers or fractional hours
Return merged intervals in chronological order

Function Signature

def merge_shifts(shifts):

Your question is Merge Overlapping Shifts. 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.