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 hintsTopics
Also asked at 11 companies
More Yandex Questions
Longest Subarray of 1's After Deleting One ElementMediumNumber of IslandsMediumInsert Delete GetRandom O(1)MediumLongest Palindromic SubstringMediumTrapping Rain WaterHard
View all Yandex questions