3658. GCD of Odd and Even Sums

LeetCodeMathNumber TheoryOpen on judge ↗

You are given an integer n. Your task is to compute the GCD (greatest common divisor) of two values: - sumOdd: the sum of the smallest n positive odd numbers. - sumEven: the sum of the smallest n positive even numbers. Return the GCD of sumOdd and sumEven. Example 1: Input: n = 4 Output: 4 Explanation: - Sum of the first 4 odd numbers sumOdd = 1 + 3 + 5 + 7 = 16 - Sum of the first 4

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