← All problemsSign in

2481. Minimum Cuts to Divide a Circle

LeetCodeMathGeometryOpen on judge ↗

A valid cut in a circle can be: - A cut that is represented by a straight line that touches two points on the edge of the circle and passes through its center, or - A cut that is represented by a straight line that touches one point on the edge of the circle and its center. Some valid and invalid cuts are shown in the figures below. Given the integer n, return the minimum number of cuts needed

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

Sign in to chat with the tutor and save your progress.

Sign in to start