Add solution #1833

Author: JoshCrozier

README.md

@@ -358,6 +358,7 @@
 1812|[Determine Color of a Chessboard Square](./1812-determine-color-of-a-chessboard-square.js)|Easy|
 1817|[Finding the Users Active Minutes](./1817-finding-the-users-active-minutes.js)|Medium|
 1832|[Check if the Sentence Is Pangram](./1832-check-if-the-sentence-is-pangram.js)|Easy|
+1833|[Maximum Ice Cream Bars](./1833-maximum-ice-cream-bars.js)|Medium|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
 1886|[Determine Whether Matrix Can Be Obtained By Rotation](./1886-determine-whether-matrix-can-be-obtained-by-rotation.js)|Easy|
 1920|[Build Array from Permutation](./1920-build-array-from-permutation.js)|Easy|

solutions/1833-maximum-ice-cream-bars.js

@@ -0,0 +1,33 @@
+/**
+ * 1833. Maximum Ice Cream Bars
+ * https://leetcode.com/problems/maximum-ice-cream-bars/
+ * Difficulty: Medium
+ *
+ * It is a sweltering summer day, and a boy wants to buy some ice cream bars.
+ *
+ * At the store, there are n ice cream bars. You are given an array costs of
+ * length n, where costs[i] is the price of the ith ice cream bar in coins.
+ * The boy initially has coins coins to spend, and he wants to buy as many
+ * ice cream bars as possible.
+ *
+ * Note: The boy can buy the ice cream bars in any order.
+ *
+ * Return the maximum number of ice cream bars the boy can buy with coins.
+ */
+
+/**
+ * @param {number[]} costs
+ * @param {number} coins
+ * @return {number}
+ */
+var maxIceCream = function(costs, coins) {
+  let count = 0;
+  costs.sort((a, b) => a - b);
+  for (let i = 0; i < costs.length; i++) {
+    if (costs[i] <= coins) {
+      count++;
+      coins -= costs[i];
+    }
+  }
+  return count;
+};