diff --git a/data_structures/array/ArrayPairSum.py b/data_structures/array/ArrayPairSum.py
new file mode 100644
index 00000000..d2c76c68
--- /dev/null
+++ b/data_structures/array/ArrayPairSum.py
@@ -0,0 +1,11 @@
+#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.
+
+class Solution:
+    def arrayPairSum(self, nums: List[int]) -> int:
+        nums.sort()
+        x = 0
+        i=0
+        while(i<len(nums)):
+            x+=min(nums[i],nums[i+1])   
+            i+=2
+        return(x)