Perfect Squares at Yandex

Medium56.3% acceptance

This problem has 50.0% frequency at Yandex.

Problem Description

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 the product of some integer with itself. For example, `1`, `4`, `9`, and `16` are perfect squares while `3` and `11`...

Read full problem and hints

Topics

Also asked at 11 companies


More Yandex Questions

View all Yandex questions