From b14de4e47042bcabdd70ca67e6c1d290cd076906 Mon Sep 17 00:00:00 2001
From: AasheeshLikePanner <ashishlearningsoftware@gmail.com>
Date: Mon, 9 Oct 2023 22:24:33 +0530
Subject: [PATCH 1/2] Adding doctests in longest_sub_array.py

---
 dynamic_programming/longest_sub_array.py | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

diff --git a/dynamic_programming/longest_sub_array.py b/dynamic_programming/longest_sub_array.py
index b477acf61e66..c5f384edb6c5 100644
--- a/dynamic_programming/longest_sub_array.py
+++ b/dynamic_programming/longest_sub_array.py
@@ -16,6 +16,21 @@ def __init__(self, arr):
         self.array = arr.split(",")
 
     def solve_sub_array(self):
+        """
+              Solve the maximum subarray sum problem using dynamic programming.
+              Returns:
+              int: The maximum subarray sum.
+              Examples:
+              >>> subarray = SubArray("1, 2, 3, -2, 5")
+              >>> subarray.solve_sub_array()
+              9
+              >>> subarray = SubArray("-2, 1, -3, 4, -1, 2, 1, -5, 4")
+              >>> subarray.solve_sub_array()
+              6
+              >>> subarray = SubArray("1")
+              >>> subarray.solve_sub_array()
+              1
+        """
         rear = [int(self.array[0])] * len(self.array)
         sum_value = [int(self.array[0])] * len(self.array)
         for i in range(1, len(self.array)):

From f04ed5674ef502298baed3e0251ec3d076bbc86d Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Mon, 9 Oct 2023 16:58:50 +0000
Subject: [PATCH 2/2] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 dynamic_programming/longest_sub_array.py | 26 ++++++++++++------------
 1 file changed, 13 insertions(+), 13 deletions(-)

diff --git a/dynamic_programming/longest_sub_array.py b/dynamic_programming/longest_sub_array.py
index c5f384edb6c5..43c3d88c8305 100644
--- a/dynamic_programming/longest_sub_array.py
+++ b/dynamic_programming/longest_sub_array.py
@@ -17,19 +17,19 @@ def __init__(self, arr):
 
     def solve_sub_array(self):
         """
-              Solve the maximum subarray sum problem using dynamic programming.
-              Returns:
-              int: The maximum subarray sum.
-              Examples:
-              >>> subarray = SubArray("1, 2, 3, -2, 5")
-              >>> subarray.solve_sub_array()
-              9
-              >>> subarray = SubArray("-2, 1, -3, 4, -1, 2, 1, -5, 4")
-              >>> subarray.solve_sub_array()
-              6
-              >>> subarray = SubArray("1")
-              >>> subarray.solve_sub_array()
-              1
+        Solve the maximum subarray sum problem using dynamic programming.
+        Returns:
+        int: The maximum subarray sum.
+        Examples:
+        >>> subarray = SubArray("1, 2, 3, -2, 5")
+        >>> subarray.solve_sub_array()
+        9
+        >>> subarray = SubArray("-2, 1, -3, 4, -1, 2, 1, -5, 4")
+        >>> subarray.solve_sub_array()
+        6
+        >>> subarray = SubArray("1")
+        >>> subarray.solve_sub_array()
+        1
         """
         rear = [int(self.array[0])] * len(self.array)
         sum_value = [int(self.array[0])] * len(self.array)