Added new Integer Break Problem (#27)

Co-authored-by: Gourav Rusiya <[email protected]>

Author: Rudra407

C++/Integer-Break.cpp

@@ -0,0 +1,35 @@
+/*
+*
+*
+* Runtime : 4 ms
+* Memory  : 6 MB
+* 
+*
+*/
+class Solution {
+  public:
+
+    int integerBreak(int n) {
+
+	// when n = 0,1 no possible cuts hence store 0
+      int val[n + 1];
+      val[0] = val[1] = 0;
+
+	// calculate for all possible cuts possible from 1 to n
+      for (int i = 1; i <= n; i++) {
+        int max_value = INT_MIN;
+	
+	/*for n = 6 calculate for all possible cuts like maximum of
+	 {(1,5),(5,1)}, {(4,2),(2,4)},{ (3,3) }
+	*/	
+        for (int j = 1; j <= i / 2; j++) {
+          max_value = max(max_value, max((i - j) * j, j * val[i - j]));
+        }
+
+        val[i] = max_value;
+      }
+
+      return val[n];
+
+    }
+};

README.md

@@ -214,11 +214,12 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 
 ## Dynamic Programming
 
-| #   | Title                                                                                    | Solution                                    | Time     | Space    | Difficulty | Tag | Note |
-| --- | ---------------------------------------------------------------------------------------- | ------------------------------------------- | -------- | -------- | ---------- | --- | ---- |
-| 416 | [ Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | [C++](./C++/Partition-Equal-Subset-Sum.cpp) | _O(n^2)_ | _O(n^2)_ | Medium     | DP  |      |
-| 56  | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)                    | [Python](./Python/wildcard-matching.py)     | _O(n^2)_ | _O(n^2)_ | Hard       | DP  |      |
-| 139  | [Word Break](https://leetcode.com/problems/word-break/)                    		 | [Python](./Python/word-break-1.py)     	| _O(n^3)_ | _O(n)_  | Medium     | DP  |      |
+| #   | Title                                                                 | Solution                                  | Time   | Space  | Difficulty | Tag   | Note |
+| --- | --------------------------------------------------------------------- | ----------------------------------------- | ------ | ------ | ---------- | ----- | ---- |
+| 416 | [ Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)| [C++](./C++/Partition-Equal-Subset-Sum.cpp)| _O(n^2)_ | _O(n^2)_ | Medium  | DP |      |
+| 56  | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | [Python](./Python/wildcard-matching.py)     | _O(n^2)_ | _O(n^2)_ | Hard     | 	 | 
+| 343  | [Integer Break](https://leetcode.com/problems/integer-break/) 	      | [C++](./C++/Integer-Break.cpp) 	    | _O(n^2)_ | _O(n)_ | Medium     | 	 | 
+| 139  | [Word Break](https://leetcode.com/problems/word-break/)              | [Python](./Python/word-break-1.py)     	| _O(n^3)_ | _O(n)_  | Medium     | DP  |      |
 
 
 <br/>