We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Given a positive integer n, find the smallest number of squared integers which sum to n.
For example, given n = 13, return 2 since 13 = 32 + 22 = 9 + 4.
n = 13
2
13 = 32 + 22 = 9 + 4
Given n = 27, return 3 since 27 = 32 + 32 + 32 = 9 + 9 + 9.
n = 27
3
27 = 32 + 32 + 32 = 9 + 9 + 9
The text was updated successfully, but these errors were encountered:
vaskoz
No branches or pull requests
Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Given a positive integer n, find the smallest number of squared integers which sum to n.
For example, given
n = 13
, return2
since13 = 32 + 22 = 9 + 4
.Given
n = 27
, return3
since27 = 32 + 32 + 32 = 9 + 9 + 9
.The text was updated successfully, but these errors were encountered: