Dynamic Programming IV#
Strictly speaking, this section is not dynamic programming.
Intervals#
All intervals operation related problems such as interval merge, interval insert, interval delete, interval query, etc.
Two techniques are typically used:
sorting. we can sort the intervals by start or end, or sort the start increasingly and end decreasingly.
draw the intervals to visualize the problem
Delete Interval#
Merge Interval#
Intersection of Interval#
[0986]