using methods to solve problem

//for finding maximum subarray sum: 

class Main {

    public static void main(String[] args) {

        int[] arr = {4, -1, 2, 1};


        int cur_sum = arr[0];

        int max_sum = arr[0];  // track the best sum so far


        for (int i = 1; i < arr.length; i++) {

            // either extend the previous subarray OR start fresh from arr[i]

            cur_sum = Math.max(arr[i], cur_sum + arr[i]);


            // update the maximum sum found so far

            max_sum = Math.max(max_sum, cur_sum);

        }


        System.out.println("Maximum Subarray Sum = " + max_sum);

    }

}

//for finding minimum subarray of the sum:

 class Main {

    public static void main(String[] args) {

        int[] arr = {4, -1, 2, 1};


        int cur_sum = arr[0];

        int max_sum = arr[0];  // track the best sum so far


        for (int i = 1; i < arr.length; i++) {

            // either extend the previous subarray OR start fresh from arr[i]

            cur_sum = Math.min(arr[i], cur_sum + arr[i]);


            // update the maximum sum found so far

            max_sum = Math.min(max_sum, cur_sum);

        }


        System.out.println("Maximum Subarray Sum = " + max_sum);

    }

}



Comments

Post a Comment

Popular posts from this blog

optimsed apporach

//For finding buying and seeling the stock:  class Main {     public static void main(String[] args) {         int[] price = {8, 2, 1, 5, 4, 6};         int min = Integer.MAX_VALUE;         int max = 0;         for(int i=0;i<price.length;i++){             if(price[i]<min){                 min=price[i];             }             else if(price[i]-min>max){                 max=price[i]-min;             }         }         System.out.println("Buy:"+min);                 System.out.println("sell:"+max);     } } //finiding leader in an array: // Online Java Compiler // Use this editor to write, compile and...
Read more

what i learn

  Great question, R — and I love that you're thinking critically about how indexing works in loops. Let's clarify this with precision. 🧠 Why neg[i++] Starts at Index 0 When you write neg[i++] , you're accessing the current value of i , then incrementing it. So if i = 0 , this line: combine[k++] = neg[i++]; means: Use neg[0] (the first element). Then increment i to 1. So you're not saying i++ = 1 — you're saying: "Use i = 0 now, and after this line, i becomes 1." This is called post-increment , and it's a common pattern in Java when you want to use the current index before moving to the next. 🔍 Quick Illustration int i = 0; System.out.println(neg[i++]); // prints neg[0], then i becomes 1 System.out.println(neg[i]); // now prints neg[1] So the loop starts at index 0 because arrays in Java are zero-indexed — meaning the first element is at position 0, not 1. ✅ Summary i++ means "use current i , then increment....
Read more

creative codes

 //finding An equilibrium index is a position in the array where the sum of elements to the left = sum of elements to the right . // Online Java Compiler // Use this editor to write, compile and run your Java code online class Main {     public static void main(String[] args) {         int[] arr = {3, 4, 8, -9, 20, 6};         int n = arr.length;         int sum=0;         boolean found=false;          for(int i=0; i<n;i++)  sum+=arr[i];          int left_sum=0;                    for(int i=0;i<n;i++){              int right_sum=sum-left_sum-arr[i];              if(left_sum==right_sum){                  found=true;                 ...
Read more