Greedy placement

Most constrained first.

Try this in Python

intervals = [(0, 2), (1, 3), (3, 4)]
intervals.sort(key=lambda x: x[1])
print(intervals[0])

Key takeaways

• CSP-lite propagation.
• Scan order.
• Epsilon geometry.