Tap here to switch tabs
Problem
Submissions

Problem: Perfect Squares

Perfect Squares asks you to express a given positive integer as a sum of perfect squares and return the smallest number of squares required.

Statement

Given an integer, n, return the least number of perfect square numbers that sum to n.

A perfect square is an integer that is the square of an integer. In other words, it is an integer that is the result of multiplying a whole integer by itself. For example, 11, 44, 99, and 1616 are perfect squares, but 33, 55, and 1111 are not.

Constraints:

  • 1≤1 \leq n ≤103\leq 10^3

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Perfect Squares

Perfect Squares asks you to express a given positive integer as a sum of perfect squares and return the smallest number of squares required.

Statement

Given an integer, n, return the least number of perfect square numbers that sum to n.

A perfect square is an integer that is the square of an integer. In other words, it is an integer that is the result of multiplying a whole integer by itself. For example, 11, 44, 99, and 1616 are perfect squares, but 33, 55, and 1111 are not.

Constraints:

  • 1≤1 \leq n ≤103\leq 10^3