<<< Click to view my profile 🌱

GFG POTD : Aug 9 2024

class Solution {
int Maximize(int arr[]) {

    Arrays.sort(arr);
    long sum=0;
    int mod =(int) 1000000007;

    for (int i=0;i<=arr.length-1;i++){
    sum +=(long) i * arr[i];
    sum %=mod;

    }

      return (int)sum;
    }
}

Missing in Array:

class Solution {

    // Note that the size of the array is n-1
    int missingNumber(int n, int arr[]) {

        int sum = 0, sum2=0,fin=0;
        
        for(int a : arr ){
            sum+=a;
        }
        sum2= (n*(n+1))/2;
        
    return sum2-sum ;
        
    }
}

Kadane’s Algorithm :

class Solution {

    int maxSubarraySum(int[] arr) {
       int currs = 0;
        int max = Integer.MIN_VALUE;

        for(int i = 0; i < arr.length; i++) {
            currs += arr[i];
            max = Math.max(max, currs);
            
            if (currs < 0) {
                currs = 0;
            }
        }
        
        return max;
    }

}

Middle of a Linked List