Dont fall jennifer!

CodeChefOpen on judge ↗

This is the red carpet and jennifer lawrence is yet again planning to stumble for no particular reason.There are N carpets each having a different length. Let the floor be considered a 1-D path on x-axis with each carpet represented by ai bi.The oscar committee decides to color all carpets such that no two overlapping carpets have the same color.Two carpets can overlap at their end points. They wa

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