Polygon Triangulation

CodeChefOpen on judge ↗

Harry is given a question to solve. The question contains these steps: - Draw a regular polygon with **N** sides. (N can be any integer, where N>=3) - Then he has to find out the number of ways in which the polygon can be cut by connecting vertices with non-crossing line segments. Finding the number of different ways for smaller polygons is easy. But he is interested in finding out the number

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