From a13285872c9a388e9bebed7b506d36747ab87bb1 Mon Sep 17 00:00:00 2001
From: eastmest <67630180+eastmest@users.noreply.github.com>
Date: Sun, 26 Sep 2021 10:16:20 +0530
Subject: [PATCH] Create Rachitec Largest sum continuos subarray
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

This code is Largest sum continuos subarray they are Given a zero index array find the sum of contiguos subarray which has the largest sum.
Time-complexity: O(n), Auxiliary space: O(1),Implementation
This algorithm doesn’t work for negative numbers,it simply returns zero if all numbers are negative.
---
 Rachitec Largest sum continuos subarray | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 Rachitec Largest sum continuos subarray

diff --git a/Rachitec Largest sum continuos subarray b/Rachitec Largest sum continuos subarray
new file mode 100644
index 000000000..1ea0d9c5f
--- /dev/null
+++ b/Rachitec Largest sum continuos subarray	
@@ -0,0 +1,11 @@
+def max_continuos_sum(a)
+   max_ending_sum = max_slice_sum =0 
+   n=a.length
+   for i in 0...n
+    max_ending_sum = [0,(max_ending_sum+a[i])].max
+    max_slice_sum = [max_slice_sum,max_ending_sum].max
+   end
+    return  max_slice_sum
+end
+
+max_continuos_sum([1,1,-1,2,3,4,-9,3,4,5,-6]) # => 13