Day 13 problem

Hello and welcome back brave human being,

So far in the series, we’ve seen that less is more and that identifying the correct pattern makes your life easier.

In today’s problem, I aim for you to warm up your muscles and then put them to a test, therefore I am going to give you two problems and send both solutions on Friday.

Day 13: Check if any two intervals intersect among a given set of intervals 

Given a set of intervals, check if any two intervals intersect.

Day 14: 435. Non-overlapping Intervals

Given an array of intervals, return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

This is a full-brain workout.

See you Friday!

Denisse