Merge branch 'sachuverma:master' into patch-2

Author: OmShivamR24

Leetcode Daily Challenge/October-2021/14. Perfect Squares.cpp

@@ -0,0 +1,43 @@
+/*
+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.
+
+ 
+
+Example 1:
+
+Input: n = 12
+Output: 3
+Explanation: 12 = 4 + 4 + 4.
+
+
+Example 2:
+
+Input: n = 13
+Output: 2
+Explanation: 13 = 4 + 9.
+ 
+
+Constraints:
+
+1 <= n <= 104
+*/
+
+class Solution {
+public:
+    int numSquares(int n) {
+        vector<int> count(n+1,INT_MAX);
+        
+        count[0]=0;
+        for(int i=1;i<=n;i++) {
+            for(int j=1;j*j<=i;j++) {
+                count[i]=min(count[i],count[i-j*j]+1);
+            }
+        }
+        
+        return count[n];
+            
+        
+    }
+};

Leetcode Daily Challenge/October-2021/README.md

@@ -13,3 +13,4 @@
 | 9.  | [Word Search II](https://leetcode.com/problems/word-search-ii/) | [cpp](./9.%20Word%20Search%20II.cpp) |
 | 10.  | [Bitwise And of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [cpp](./10.%20Bitwise%20AND%20of%20Numbers%20Range.cpp) |
 | 11.  | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [cpp](./11.%20Diameter%20of%20Binary%20Tree.cpp) |
+| 14.  | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) | [cpp](./14.%20Perfect%20Squares.cpp) |