LC-0561 Easy LeetCode

561. Array Partition

Array Greedy Sorting Counting Sort

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 80% Topics: Array, Greedy, Sorting, Counting Sort

View full problem on LeetCode

Also on leetcode.ca (community mirror)

Reading material

Arrays & Hashing 12 min Greedy 11 min Sorting 13 min

Reference solution (spoiler · java)

import java.util.*;

class Solution {
    int arrayPairSum(int[] nums) {
        Arrays.sort(nums);
        int result = 0;
        for (int i = 0; i < nums.length; i += 2) {
            result += nums[i];
        }
        return result;
    }
}

Solution from kamyu104/LeetCode-Solutions · MIT