LeetCode #3658 — EASY

GCD of Odd and Even Sums

Build confidence with an intuition-first walkthrough focused on math fundamentals.

Solve on LeetCode

The Problem

Problem Statement

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 even numbers sumEven = 2 + 4 + 6 + 8 = 20

Hence, GCD(sumOdd, sumEven) = GCD(16, 20) = 4.

Example 2:

Input: n = 5

Output: 5

Explanation:

Sum of the first 5 odd numbers sumOdd = 1 + 3 + 5 + 7 + 9 = 25
Sum of the first 5 even numbers sumEven = 2 + 4 + 6 + 8 + 10 = 30

Hence, GCD(sumOdd, sumEven) = GCD(25, 30) = 5.

Constraints:

1 <= n <= 1000

Step 01

Brute Force Baseline

Problem summary: 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.

Baseline thinking

Start with the most direct exhaustive search. That gives a correctness anchor before optimizing.

Pattern signal: Math

Example 1

Example 2

Step 02

Core Insight

What unlocks the optimal approach

The first <code>n</code> odd numbers sum to <code>n * n</code>
First <code>n</code> even numbers sum to <code>n * (n + 1)</code>
<code>gcd(n, n + 1) = 1</code>, so the answer is <code>n</code>

Interview move: turn each hint into an invariant you can check after every iteration/recursion step.

Step 03

Algorithm Walkthrough

Iteration Checklist

Define state (indices, window, stack, map, DP cell, or recursion frame).
Apply one transition step and update the invariant.
Record answer candidate when condition is met.
Continue until all input is consumed.

Use the first example testcase as your mental trace to verify each transition.

Step 04

Edge Cases

Minimum Input

Single element / shortest valid input

Validate boundary behavior before entering the main loop or recursion.

Duplicates & Repeats

Repeated values / repeated states

Decide whether duplicates should be merged, skipped, or counted explicitly.

Extreme Constraints

Upper-end input sizes

Re-check complexity target against constraints to avoid time-limit issues.

Invalid / Corner Shape

Empty collections, zeros, or disconnected structures

Handle special-case structure before the core algorithm path.

Step 05

Full Annotated Code

Source-backed implementations are provided below for direct study and interview prep.

// Accepted solution for LeetCode #3658: GCD of Odd and Even Sums
class Solution {
    public int gcdOfOddEvenSums(int n) {
        return n;
    }
}

// Accepted solution for LeetCode #3658: GCD of Odd and Even Sums
func gcdOfOddEvenSums(n int) int {
	return n
}

# Accepted solution for LeetCode #3658: GCD of Odd and Even Sums
class Solution:
    def gcdOfOddEvenSums(self, n: int) -> int:
        return n

// Accepted solution for LeetCode #3658: GCD of Odd and Even Sums
fn gcd_of_odd_even_sums(n: i32) -> i32 {
    let mut a = 1;
    let mut b = 2;

    for i in 1..n {
        a += 1 + 2 * i;
        b += 2 + 2 * i;
    }

    loop {
        let m = b % a;
        if m == 0 {
            return a;
        }

        b = a;
        a = m;
    }
}

fn main() {
    let ret = gcd_of_odd_even_sums(100);
    println!("ret={ret}");
}

#[test]
fn test() {
    assert_eq!(gcd_of_odd_even_sums(4), 4);
    assert_eq!(gcd_of_odd_even_sums(5), 5);
}

// Accepted solution for LeetCode #3658: GCD of Odd and Even Sums
function gcdOfOddEvenSums(n: number): number {
    return n;
}

Step 06

Interactive Study Demo

Use this to step through a reusable interview workflow for this problem.

Custom checkpoints (one per line)

Press Step or Run All to begin.

Step 07

Complexity Analysis

Time

O(1)

Space

O(1)

Approach Breakdown

ITERATIVE

O(n) time

O(1) space

Simulate the process step by step — multiply n times, check each number up to n, or iterate through all possibilities. Each step is O(1), but doing it n times gives O(n). No extra space needed since we just track running state.

MATH INSIGHT

O(log n) time

O(1) space

Math problems often have a closed-form or O(log n) solution hidden behind an O(n) simulation. Modular arithmetic, fast exponentiation (repeated squaring), GCD (Euclidean algorithm), and number theory properties can dramatically reduce complexity.

Shortcut: Look for mathematical properties that eliminate iteration. Repeated squaring → O(log n). Modular arithmetic avoids overflow.

Coach Notes

Common Mistakes

Review these before coding to avoid predictable interview regressions.

Overflow in intermediate arithmetic

Wrong move: Temporary multiplications exceed integer bounds.

Usually fails on: Large inputs wrap around unexpectedly.

Fix: Use wider types, modular arithmetic, or rearranged operations.