+6 Solutions (2 Arrays + 1 BinarySearch + 3 DP) (#34)

* August Monthly Leetcode Day-1

* Added 6 Solutions (2 Array + 1 BinarySearch + 3 DP)

Author: lokendra1704

Diff for: Python/best-time-to-buy-and-sell-stock-ii.py

@@ -0,0 +1,17 @@
+'''
+Speed: 99.14%
+Memory:
+Time Complexity: O(n)
+'''
+class Solution:
+    def solve(self, prices):
+        # Write your code here
+        if len(prices)<2:return 0
+        buy = prices[0]
+        profit = 0
+        for i in range(1,len(prices)):
+            if prices[i]<prices[i-1]:
+                profit+=prices[i-1]-buy
+                buy = prices[i]
+        profit+=prices[-1]-buy
+        return profit

Diff for: Python/decode-ways.py

@@ -0,0 +1,41 @@
+'''
+Speed:  93.43%
+Memory: 38.43%
+Time Complexity: O(n)
+'''
+class Solution:
+    def numDecodings(self, s: str) -> int:
+        if not s or s[0]=='0':
+            return 0
+        dp = [0]*(len(s)+1)
+        dp[0],dp[1] = 1,1
+        for j in range(2,len(s)+1):
+            i = j-1
+            a = int(s[i])
+            b = int(s[i-1:i+1])
+            if 0<a<10:
+                dp[j]=dp[j-1]
+            if s[i-1]!='0' and 0<b<27:
+                dp[j]+=dp[j-2]
+        return dp[-1]
+
+
+##Improved
+'''
+Speed: 93.14%
+Memory: 72.58%
+'''
+class Solution:
+    def numDecodings(self, s: str) -> int:
+        if not s or s[0]=='0':
+            return 0
+        p,q = 1,1
+        for i in range(1,len(s)):
+            a = int(s[i])
+            y = 0
+            if 0<a<10:
+                y=q
+            if s[i-1]!='0' and 0<int(s[i-1:i+1])<27:
+                y+=p
+            p,q = q,y
+        return q

Diff for: Python/divisor-game.py

@@ -0,0 +1,13 @@
+'''
+Speed:              5.11%
+Memory:             9.88%
+Time Complexity:    O(N^2)
+'''
+class Solution:
+    def divisorGame(self, N: int) -> bool:
+        dp = [False]*(N+1)
+        for i in range(N+1):
+            for j in range(1,i):
+                if i%j==0 and dp[i-j]==False:
+                    dp[i] = True
+        return dp[N]

Diff for: Python/edit-distance.py

@@ -0,0 +1,19 @@
+'''
+Speed:              99.48%
+Memory:             81.78%
+Time Complexity:    O(N*M) where N = len(s1) and M = len(s2)
+'''
+class Solution:
+    def minDistance(self, s1: str, s2: str) -> int:
+        @lru_cache(None)
+        def editdistance(i,j,s1=s1,s2=s2):
+            if not i:
+                return j
+            if not j:
+                return i
+            if s1[i-1]==s2[j-1]:
+                return editdistance(i-1,j-1)
+            else:
+                return 1 + min(editdistance(i-1,j),editdistance(i,j-1),editdistance(i-1,j-1))
+                # Insert,Delete,replace
+        return editdistance(len(s1),len(s2),s1,s2)

Diff for: Python/find-minimum-in-rotated-sorted-array.py

@@ -0,0 +1,18 @@
+'''
+Speed:  37.59%
+Memory: 20.90%
+Time Complexity: O(logn)
+'''
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        if nums[0]<=nums[-1]:
+            return nums[0]
+        l,h = 0,len(nums)-1
+        while l<=h:
+            mid = h - (h-l)//2
+            if mid>0 and nums[mid]<nums[mid-1]:
+                return nums[mid]
+            elif nums[mid]>nums[0]:
+                l = mid+1
+            else:
+                h = mid-1

Diff for: Python/pascals-triangle-ii.py

@@ -0,0 +1,13 @@
+'''
+Speed:  77.11%
+Memory: 82.57%
+Time Complexity: O(n)
+'''
+class Solution:
+    def getRow(self, k: int) -> List[int]:
+        res = [1]*(k+1)
+        #res[0]=1
+        for i in range(1,k):
+            for j in range(i,0,-1):
+                res[j]+=res[j-1]
+        return res

Diff for: README.md

@@ -82,13 +82,15 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 
 # Array
 
-| #   | Title                                                                  | Solution                                       | Time       | Space  | Difficulty | Video Explaination       | Note |
+| #   | Title                                                                  | Solution                                       | Time       | Space  | Difficulty | Note       | Video Explaination |
 | --- | ---------------------------------------------------------------------- | ---------------------------------------------- | ---------- | ------ | ---------- | --------- | ---- |
 | 56  | [Merge Intervals](https://leetcode.com/problems/merge-intervals)       | [Python](./Python/56_MergeIntervals.py)        | _O(nlogn)_ | _O(n)_ | Medium     | Intervals |      |
 | 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Java](./Java/missing-number.java)              | _O(n)_     | _O(1)_ | Easy       | Array     |   [Tutorial](https://youtu.be/VwvGEE_OGss)   |
 | 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Java](./Java/Degree-of-an-Array.java)              | _O(n)_     | _O(n)_ | Easy       | Array     |      |
 | 1089 | [Duplicate Zeroes](https://leetcode.com/problems/duplicate-zeros/)     | [JavaScript](./JavaScript/Duplicate-Zeroes.js) | _O(n)_     | _O(n)_ | Easy       | Array     |      |
 | 1502 | [Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)     | [Java](./Java/can-make-arithmetic-progression-from-sequence.java) | _O(n)_     | _O(1)_ | Easy       | Array     |      |
+| 122  | [Best Time to buy and sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)       | [Python](./Python/best-time-to-buy-and-sell-stock-ii.py)        | _O(N)_ | _O(1)_ | Medium     | Stocks |      |
+| 119  | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii)       | [Python](./Python/pascals-triangle-ii.py)        | _O(N^2)_ | _O(K)_ | Easy     |  |      |
 
 
 <br/>
@@ -248,6 +250,9 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 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  |      |
 | 1092 | [Shortest Common Supersequence](https://leetcode.com/problems/shortest-common-supersequence/)              | [C++](./C++/Shortest-Common-Supersequence.cpp)     	| _O(n^2)_ | _O(n^2)_  | Hard     | DP  |      |
+| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance/)              | [Python](./Python/edit-distance.py)     	| _O(N*M)_ | _O(n^2)_  | Medium     | Levenshtein Distance  |      |
+| 91 | [Decode ways](https://leetcode.com/problems/decode-ways/)              | [Python](./Python/decode-ways.py)     	| _O(N)_ | _O(N)_  | Easy     | DP  |      |
+| 1025| [Divisor Game](https://leetcode.com/problems/divisor-game/)              | [Python](./Python/divisor-game.py)     	| _O(N^2)_ | _O(N)_  | Easy     | DP  |      |
 
 
 <br/>
@@ -263,6 +268,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 035 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/)                 | [Python](./Python/35.SearchInsertPosition.py)                                                                             | _O(logn)_ | _O(1)_ | Easy       |     | Binary Search |
 | 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/)                           | [Java](./Java/May-LeetCoding-Challenge/Day-1-First-Bad-Version.java) <br> [JavaScript](./JavaScript/First-Bad-Version.js) | _O(logn)_ | _O(1)_ | Easy       |     | Binary Search |
 | 033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python](./Python/search-in-rotated-sorted-array.py)                                                                      | _O(logn)_ | _O(1)_ | Medium     |     | Binary Search |
+| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [Python](./Python/find-minimum-in-rotated-sorted-array.py)                                                                      | _O(logn)_ | _O(1)_ | Medium     |     | Binary Search |
 
 <br/>
 <div align="right">