array-partition.js

// Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.

// Link: https://leetcode.com/problems/array-partition/description/

//1st soln O(n)

var arrayPairSum = function(nums) {
    let sum = 0;

    nums.sort((a,b) => a-b);
    
    for(let i =0; i<nums.length; i+=2){
        sum+=nums[i];
    }

    return sum;
};