Create Maximum Median Sum of Subsequences of Size 3.java

varunu28 · web-flow · commit ebde3368310d · 2025-07-27T07:51:41.000-07:00
diff --git a/Medium/Maximum Median Sum of Subsequences of Size 3.java b/Medium/Maximum Median Sum of Subsequences of Size 3.java
@@ -0,0 +1,11 @@
+class Solution {
+    public long maximumMedianSum(int[] nums) {
+        Arrays.sort(nums);
+        long sum = 0;
+        int n = nums.length;
+        for (int i = n / 3; i < n; i += 2) {
+            sum += (long) nums[i];
+        }
+        return sum;
+    }
+}
