Rohit and Geometry

CodeChefOpen on judge ↗

Rohit, one of the best coders in ByteLand, is bored solving the same type of problems again and again. His newly found love is solving problems on Convex Hull. While he was solving some problems, he came up with a new problem on a Convex Hull and has challenged other ByteLand coders to solve it. You will be given a set of N points i.e (xi , yi) in the X-Y plane. Your job is to find the number of

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