Creates pairs of integers

20th exercise - #561
https://leetcode.com/problems/array-partition-i/

pairOfIntegers.js

@@ -0,0 +1,26 @@
+/*
+Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
+
+Example 1:
+Input: [1,4,3,2]
+
+Output: 4
+Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
+Note:
+n is a positive integer, which is in the range of [1, 10000].
+All the integers in the array will be in the range of [-10000, 10000].
+*/
+
+//Answer//
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var arrayPairSum = function(nums) {
+let count = 0;
+nums.sort((a,b)=>a-b);
+for (let i = 0; i <nums.length ; i+=2) {
+count += nums[i]
+};
+return count
+};