@laigary.com~/interview/coding/561-array-partition.md$
$ cat ./coding/561-array-partition.md
[Coding]·2023-06-07·1 min read

561. Array Partition

561. Array Partition

class Solution:
    def arrayPairSum(self, nums: List[int]) -> int:
        nums.sort()
        
        res = 0
        i = 0
        
        while i < len(nums):
            res += nums[i]
            i += 2
            
        return res