bug fixes

python/array/flip0smaximum1s.py

@@ -10,6 +10,7 @@ def flip_0s_to_maximize_consecutive_1s(input, flips_allowed):
         else:
             if count_zero < flips_allowed:
                 count_zero = count_zero + 1
+                result = max(result, i - window_start + 1)
             else:
                 while True:
                     if input[window_start] == 0:

python/array/longestsamesumspan.py

@@ -9,6 +9,7 @@ def longest_span(input1, input2):
     prefix1 = 0
     prefix2 = 0
     max_span = 0
+    diff[0] = -1
     for i in range(len(input1)):
         prefix1 += input1[i]
         prefix2 += input2[i]

src/com/interview/array/Flip0sMaximum1s.java

@@ -25,6 +25,7 @@ public int flip0sToMaximizeConsecutive1s(int input[], int flipsAllowed) {
             } else {
                 if (countZero < flipsAllowed) {
                     countZero++;
+                    result = Math.max(result, i - windowStart + 1);
                 } else {
                     while(true) {
                         if (input[windowStart] == 0) {

src/com/interview/array/LongestSameSumSpan.java

@@ -24,6 +24,7 @@ public int longestSpan(int input1[], int input2[]) {
         Map<Integer, Integer> diff = new HashMap<>();
         int prefix1 = 0, prefix2 = 0;
         int maxSpan = 0;
+        diff.put(0, -1);
         for (int i = 0; i < input1.length ; i++) {
             prefix1 += input1[i];
             prefix2 += input2[i];
@@ -38,9 +39,8 @@ public int longestSpan(int input1[], int input2[]) {
     }
 
     public static void main(String args[]) {
-        int input1[] = {0, 1, 0, 1, 1, 1, 1};
-        int input2[] = {1, 1, 1, 1, 1, 0, 1};
-
+        int input1[] = {1, 0, 0, 1, 1, 0};
+        int input2[] = {0, 1, 1, 0, 1 ,1};
         LongestSameSumSpan lsss = new LongestSameSumSpan();
         System.out.print(lsss.longestSpan(input1, input2));
     }