Delete dynamic_programming/longest_sub_array.py
diff --git a/dynamic_programming/longest_sub_array.py b/dynamic_programming/longest_sub_array.py
deleted file mode 100644
index b477acf61e66..000000000000
--- a/dynamic_programming/longest_sub_array.py
+++ /dev/null
@@ -1,33 +0,0 @@
-"""
-Author  : Yvonne
-
-This is a pure Python implementation of Dynamic Programming solution to the
-    longest_sub_array problem.
-
-The problem is  :
-Given an array, to find the longest and continuous sub array and get the max sum of the
-    sub array in the given array.
-"""
-
-
-class SubArray:
-    def __init__(self, arr):
-        # we need a list not a string, so do something to change the type
-        self.array = arr.split(",")
-
-    def solve_sub_array(self):
-        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)):
-            sum_value[i] = max(
-                int(self.array[i]) + sum_value[i - 1], int(self.array[i])
-            )
-            rear[i] = max(sum_value[i], rear[i - 1])
-        return rear[len(self.array) - 1]
-
-
-if __name__ == "__main__":
-    whole_array = input("please input some numbers:")
-    array = SubArray(whole_array)
-    re = array.solve_sub_array()
-    print(("the results is:", re))

### Describe your change:

Fixes #8098. 

Deleted `longest_sub_array.py` since `longest_sub_array.py` solves a similar problem with `max_subarray_sum.py` (maximum sum of a subarray), but it has no doctests and not as completed as the latter.

* [ ] Add an algorithm?
* [ ] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?

### Checklist:
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file.  To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [ ] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
* [x] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a [closing keyword](https://docs.github.com/en/issues/tracking-your-work-with-issues/linking-a-pull-request-to-an-issue): "Fixes #ISSUE-NUMBER".
