Add Kadane's Algorithm to dp/ folder

Added Kadane's Algorithm to the dp/ folder to find the maximum sum of a contiguous subarray. 
The implementation follows TheAlgorithms/Python guidelines:
- Returns both maximum sum and the corresponding subarray.
- Includes type hints, docstring, and doctests.
- References Wikipedia for source: https://en.wikipedia.org/wiki/Maximum_subarray_problem

Example:
>>> kadane([-2,1,-3,4,-1,2,1,-5,4])
(6, [4, -1, 2, 1])

Author: Tanish-S-K

dynamic_programming/kadane_algorithm.py

@@ -0,0 +1,62 @@
+"""
+Kadane's Algorithm implementation in Python.
+
+Finds the maximum sum of a contiguous subarray within a one-dimensional array of numbers.
+
+Source:
+https://en.wikipedia.org/wiki/Maximum_subarray_problem
+"""
+
+from typing import List, Tuple
+
+
+def kadane(arr: List[int]) -> Tuple[int, List[int]]:
+    """
+    Returns the maximum sum of a contiguous subarray and the subarray itself.
+
+    Parameters
+    ----------
+    arr : List[int]
+        List of integers (can be positive, negative, or zero).
+
+    Returns
+    -------
+    Tuple[int, List[int]]
+        Maximum subarray sum and the corresponding subarray.
+
+    Examples
+    --------
+    >>> kadane([-2,1,-3,4,-1,2,1,-5,4])
+    (6, [4, -1, 2, 1])
+    
+    >>> kadane([1,2,3,4])
+    (10, [1, 2, 3, 4])
+    
+    >>> kadane([-1,-2,-3])
+    (-1, [-1])
+    """
+    if not arr:
+        raise ValueError("Input array cannot be empty")
+
+    max_current = max_global = arr[0]
+    start = end = s = 0
+
+    for i in range(1, len(arr)):
+        if arr[i] > max_current + arr[i]:
+            max_current = arr[i]
+            s = i
+        else:
+            max_current += arr[i]
+
+        if max_current > max_global:
+            max_global = max_current
+            start = s
+            end = i
+
+    return max_global, arr[start:end+1]
+
+
+# Doctest runner
+if __name__ == "__main__":
+    import doctest
+    doctest.testmod()