Add new questions

prabhupant · prabhupant · commit 22dc44ac288d · 2019-09-02T15:59:33.000+05:30
diff --git a/data_structures/array/kadane_algorithm.py b/data_structures/array/kadane_algorithm.py
@@ -0,0 +1,10 @@
+def max_sum(arr):
+    max_so_far = arr[0]
+    curr_max = arr[0]
+    for i in range(1, len(arr)):
+        curr_max = max(arr[i], curr_max + arr[i])
+        max_so_far = max(max_so_far, curr_max)
+
+    return max_so_far
+
+
diff --git a/data_structures/array/max_triplet_sum.py b/data_structures/array/max_triplet_sum.py
@@ -0,0 +1,23 @@
+import sys
+
+def max_sum(arr):
+    first = second = third = -sys.maxsize
+
+    for i in arr:
+        if i > first:
+            third = second
+            second = first 
+            first = i
+        elif i > second:
+            third = second
+            second = i
+        elif i > third:
+            third = i
+
+    return first + second + third
+
+
+arr = [1,3,6,3,6,8,3,3,7,9,4,-1,-1]
+
+print(max_sum(arr))
+
diff --git a/data_structures/array/number_of_1_in_sorted_array.py b/data_structures/array/number_of_1_in_sorted_array.py
@@ -0,0 +1,20 @@
+# The array is sorted in decreasing order
+
+def count(arr):
+    start = 0
+    end = len(arr) - 1
+
+    while start <= end:
+        mid = (start + end) // 2
+        if arr[mid] == 1 and (arr[mid + 1] == 0 or mid == high):
+            return mid + 1
+        if arr[mid] == 1:
+            start = mid + 1
+        else:
+            end = mid - 1
+    return 0
+
+
+arr = [0,0,0,0]
+
+print(count(arr))
