search

SarthakKeshari / Java-Questions-and-Solutions

This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
MIT License
46 stars 95 forks source link

Perfect Squares #433

Closed satyam878 closed 2 years ago

satyam878 commented 2 years ago

Enter your question -

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 are not.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/perfect-squares/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Dynamic Programming, Math

satyam878 commented 2 years ago

Please approve this issue @SarthakKeshari

SarthakKeshari commented 2 years ago

@satyam878, Kindly add your solution to "leetcode" folder. Deadline - 14/10/2021