solves maximum sum subarray in python

Author: anishSachdeva

Diff for: README.md

@@ -20,7 +20,7 @@
 | 28 | [Needle in Haystack](https://leetcode.com/problems/implement-strstr) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NeedleInHaystack.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/needle_in_haystack.py) |
 | 35 | [Search Inserted Position](https://leetcode.com/problems/search-insert-position/) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/SearchInsertPosition.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/search_insert_position.py) |
 | 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/CountAndSay.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/count_and_say.py) |
-| 53 | [Maximum SubArray](https://leetcode.com/problems/maximum-subarray) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MaximumSubArray.java) |
+| 53 | [Maximum SubArray](https://leetcode.com/problems/maximum-subarray) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MaximumSubArray.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/maximum_sum_subarray.py) |
 | 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LengthOfLastWord.java) |
 | 66 | [Plus One](https://leetcode.com/problems/plus-one) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PlusOne.java) |
 | 67 | [Add Binary](https://leetcode.com/problems/add-binary) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/AddBinary.java) |

Diff for: python/maximum_sum_subarray.py

@@ -0,0 +1,12 @@
+# Kadane's Algorithm
+from typing import List
+
+
+class Solution:
+    def maxSubArray(self, array: List[int]) -> int:
+        max_sum, current_sum = -float('infinity'), 0
+        for element in array:
+            current_sum += element
+            max_sum = max(current_sum, max_sum)
+            current_sum = max(current_sum, 0)
+        return int(max_sum)