resolve #128-mark-and-toys 문제풀이 및 문서추가

Interview-Preparation-Kit/Sorting/mark-and-toys.js

@@ -0,0 +1,21 @@
+/**
+ * @title Mark and Toys
+ * @difficulty Easy
+ * @link https://www.hackerrank.com/challenges/mark-and-toys/problem
+ */
+
+const ascendingCompare = (a, b) => a - b;
+
+function maximumToys(prices, budget) {
+  const sorted = prices.sort(ascendingCompare);
+  const {length} = sorted;
+  let sumPrice = 0;
+  for (let idx = 0; idx < length; idx++) {
+    sumPrice += sorted[idx];
+    if (sumPrice > budget) {
+      return idx;
+    }
+  }
+
+  return length;
+}

README.md

@@ -64,6 +64,10 @@ Generates the README.md.
 | --- | --- | --- |
 | Easy | [2D Array - DS](https://www.hackerrank.com/challenges/2d-array/problem) | [Solution](./Interview-Preparation-Kit/Arrays/2d-array-ds.js)|
 | Easy | [Left Rotation](https://www.hackerrank.com/challenges/ctci-array-left-rotation/problem) | [Solution](./Interview-Preparation-Kit/Arrays/left-rotation.js)|
+#### Sorting
+| Difficulty | Problem | Solution |
+| --- | --- | --- |
+| Easy | [Mark and Toys](https://www.hackerrank.com/challenges/mark-and-toys/problem) | [Solution](./Interview-Preparation-Kit/Sorting/mark-and-toys.js)|
 #### Dictionary-and-Hashmap
 | Difficulty | Problem | Solution |
 | --- | --- | --- |