Add solution #1403

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,282 LeetCode solutions in JavaScript
+# 1,283 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1071,6 +1071,7 @@
 1400|[Construct K Palindrome Strings](./solutions/1400-construct-k-palindrome-strings.js)|Medium|
 1401|[Circle and Rectangle Overlapping](./solutions/1401-circle-and-rectangle-overlapping.js)|Medium|
 1402|[Reducing Dishes](./solutions/1402-reducing-dishes.js)|Hard|
+1403|[Minimum Subsequence in Non-Increasing Order](./solutions/1403-minimum-subsequence-in-non-increasing-order.js)|Easy|
 1408|[String Matching in an Array](./solutions/1408-string-matching-in-an-array.js)|Easy|
 1410|[HTML Entity Parser](./solutions/1410-html-entity-parser.js)|Medium|
 1415|[The k-th Lexicographical String of All Happy Strings of Length n](./solutions/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js)|Medium|

solutions/1403-minimum-subsequence-in-non-increasing-order.js

@@ -0,0 +1,35 @@
+/**
+ * 1403. Minimum Subsequence in Non-Increasing Order
+ * https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/
+ * Difficulty: Easy
+ *
+ * Given the array nums, obtain a subsequence of the array whose sum of elements is strictly
+ * greater than the sum of the non included elements in such subsequence.
+ *
+ * If there are multiple solutions, return the subsequence with minimum size and if there still
+ * exist multiple solutions, return the subsequence with the maximum total sum of all its elements.
+ * A subsequence of an array can be obtained by erasing some (possibly zero) elements from the
+ * array.
+ *
+ * Note that the solution with the given constraints is guaranteed to be unique. Also return the
+ * answer sorted in non-increasing order.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var minSubsequence = function(nums) {
+  const sorted = nums.sort((a, b) => b - a);
+  const totalSum = sorted.reduce((sum, num) => sum + num, 0);
+  const result = [];
+  let currentSum = 0;
+
+  for (const num of sorted) {
+    currentSum += num;
+    result.push(num);
+    if (currentSum > totalSum - currentSum) break;
+  }
+
+  return result;
+};