Leetcode 1272. Remove Interval

Given a sorted list of non-overlapping intervals and a target interval to remove, return the resulting intervals after subtracting the target from each input interval. The core challenge is correctly handling no overlap, partial overlaps (trimming interval ends), and full containment (splitting an interval into up to two pieces).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1272. Remove Interval

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact