Interview Guides Experiences

Interview Guides

All questions/Coding

Merge Overlapping Memory Ranges

Easy

Hash TablesArrays

Problem

Problem

Given a list of memory ranges ranges, where each range is a pair [start, end] of integers and start <= end, merge all ranges that overlap or are directly adjacent. Two ranges [a, b] and [c, d] should be merged if c <= b + 1. Return the merged ranges sorted by start address.

Constraints

1 <= len(ranges) <= 10^4
ranges[i].length == 2
0 <= start <= end <= 10^9
Input ranges may be unsorted

Problem

Problem

Given a list of memory ranges ranges, where each range is a pair [start, end] of integers and start <= end, merge all ranges that overlap or are directly adjacent. Two ranges [a, b] and [c, d] should be merged if c <= b + 1. Return the merged ranges sorted by start address.

Constraints

1 <= len(ranges) <= 10^4
ranges[i].length == 2
0 <= start <= end <= 10^9
Input ranges may be unsorted

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Bae Systems Usa

Merge Overlapping IntervalsMedium

Veeva Systems

Merge Overlapping Time IntervalsEasy

Broadcom

Merge Overlapping Time IntervalsEasy

Merge Overlapping Memory Ranges | Dataford Interview Questions