Add solution #1196

JoshCrozier · JoshCrozier · commit 8632959500bf · 2025-06-28T00:27:07.000-05:00
diff --git a/README.md b/README.md
@@ -1114,6 +1114,7 @@
 1190|[Reverse Substrings Between Each Pair of Parentheses](./solutions/1190-reverse-substrings-between-each-pair-of-parentheses.js)|Medium|
 1191|[K-Concatenation Maximum Sum](./solutions/1191-k-concatenation-maximum-sum.js)|Medium|
 1192|[Critical Connections in a Network](./solutions/1192-critical-connections-in-a-network.js)|Hard|
+1196|[How Many Apples Can You Put into the Basket](./solutions/1196-how-many-apples-can-you-put-into-the-basket.js)|Easy|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|
 1201|[Ugly Number III](./solutions/1201-ugly-number-iii.js)|Medium|
 1202|[Smallest String With Swaps](./solutions/1202-smallest-string-with-swaps.js)|Medium|
diff --git a/solutions/1196-how-many-apples-can-you-put-into-the-basket.js b/solutions/1196-how-many-apples-can-you-put-into-the-basket.js
@@ -0,0 +1,32 @@
+/**
+ * 1196. How Many Apples Can You Put into the Basket
+ * https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/
+ * Difficulty: Easy
+ *
+ * You have some apples and a basket that can carry up to 5000 units of weight.
+ *
+ * Given an integer array weight where weight[i] is the weight of the ith apple,
+ * return the maximum number of apples you can put in the basket.
+ */
+
+/**
+ * @param {number[]} weight
+ * @return {number}
+ */
+var maxNumberOfApples = function(weight) {
+  weight.sort((a, b) => a - b);
+
+  let totalWeight = 0;
+  let result = 0;
+
+  for (const appleWeight of weight) {
+    if (totalWeight + appleWeight <= 5000) {
+      totalWeight += appleWeight;
+      result++;
+    } else {
+      break;
+    }
+  }
+
+  return result;
+};
