Movie Time

CodeChefOpen on judge ↗

There are $n$ movie show intervals given. Two friends Joseph and Junaid plan to watch the movie the maximum number of times possible. The intervals of show times are given. Find the maximum number of times they can watch the movie. Each interval has [start,end] both exclusive. Note: They can't watch movies in overlapping intervals. Copy the buggy code from [here!](https://pastebin.com/CS5TET01)

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI