diff --git a/Java/1877_Minimize_Maximum_Pair_Sum_in_Array.java b/Java/1877_Minimize_Maximum_Pair_Sum_in_Array.java
new file mode 100644
index 00000000..5f7a4775
--- /dev/null
+++ b/Java/1877_Minimize_Maximum_Pair_Sum_in_Array.java
@@ -0,0 +1,20 @@
+/*
+  *Solution to :- Minimize Maximum Pair Sum in Array
+  *Author :- hitesh22rana
+  *ref :- https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/
+*/
+
+class Solution {
+    public int minPairSum(int[] nums) {
+        Arrays.sort(nums);
+        int i = 0 , j = nums.length-1;
+        int ans = -1;
+        
+        while(i < j) {
+            ans = Math.max(nums[i] + nums[j] , ans);
+            i++;
+            j--;
+        }
+        return ans;
+    }
+}
\ No newline at end of file