Create Manimum odd SubArray Sum

Author: pyusha1006

Manimum odd SubArray Sum

@@ -0,0 +1,54 @@
+package hackerRank.problem.practice;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.io.PrintWriter;
+
+public class Stats1{
+	 public static void main(String[] args) throws IOException {
+	        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	        PrintWriter wr = new PrintWriter(System.out);
+	        int T = Integer.parseInt(br.readLine().trim());
+	        for(int t_i=0; t_i<T; t_i++)
+	        {
+	            int N = Integer.parseInt(br.readLine().trim());
+	            String[] arr = br.readLine().split(" ");
+	            int[] array_int = new int[N];
+	            for(int i=0; i<arr.length; i++)
+	            {
+	            	array_int[i] = Integer.parseInt(arr[i]);
+	            }
+
+	            int out_ = findMaxOddSubarraySum(array_int,N);
+	            System.out.println(out_);
+	         }
+
+	         wr.close();
+	         br.close();
+	    }
+	    static int findMaxOddSubarraySum(int arr[], int n)
+	    {
+	    	int m = Integer.MAX_VALUE;
+	    	boolean isOdd = false;
+	    	int sum = 0;
+	    	for (int i=0 ; i<n ; i++)
+	    	{
+	    		if (arr[i] > 0)
+	    			sum = sum + arr[i];
+	    		if (arr[i]%2 != 0)
+	    		{
+	    			isOdd = true;
+	    			if (m > Math.abs(arr[i]))
+	    				m = Math.abs(arr[i]);
+	    		}
+	    	}
+
+	    	if (isOdd == false)
+	    	return -1;
+	    	if (sum%2 == 0)
+	    		sum = sum - m;
+
+	    	return sum;
+	    }
+	}