Entangled Circles

CodeChefOpen on judge ↗

The description of this problem is extremely simple. You are given 2 non-intersecting circles in 3-dimensional world. Each of the circle is defined by 3 non - collinear points lying on the circle. All you have to return is whether the circles are entangled or not (just like two links of a chain). Two circles are entangled if they cannot be separated from each other without breaking any of the

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