diff --git a/Python/Minimum Moves to Equal Array Elements II.py b/Python/Minimum Moves to Equal Array Elements II.py
new file mode 100644
index 0000000..d6ecc3c
--- /dev/null
+++ b/Python/Minimum Moves to Equal Array Elements II.py	
@@ -0,0 +1,14 @@
+# Problem link: https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/
+
+class Solution:
+    def minMoves2(self, nums: List[int]) -> int:
+        nums.sort()
+        n = len(nums)
+        num = None
+        if n%2:
+            num = nums[n//2]
+        else:
+            num = (nums[n//2] + nums[(n//2)-1])//2
+        print(num)    
+        
+        return(sum((abs(i - num) for i in nums)))