Add solution #441

Author: JoshCrozier

README.md

@@ -266,6 +266,7 @@
 434|[Number of Segments in a String](./0434-number-of-segments-in-a-string.js)|Easy|
 435|[Non-overlapping Intervals](./0435-non-overlapping-intervals.js)|Medium|
 437|[Path Sum III](./0437-path-sum-iii.js)|Medium|
+441|[Arranging Coins](./0441-arranging-coins.js)|Easy|
 442|[Find All Duplicates in an Array](./0442-find-all-duplicates-in-an-array.js)|Medium|
 443|[String Compression](./0443-string-compression.js)|Medium|
 448|[Find All Numbers Disappeared in an Array](./0448-find-all-numbers-disappeared-in-an-array.js)|Easy|

solutions/0441-arranging-coins.js

@@ -0,0 +1,22 @@
+/**
+ * 441. Arranging Coins
+ * https://leetcode.com/problems/arranging-coins/
+ * Difficulty: Easy
+ *
+ * You have n coins and you want to build a staircase with these coins. The staircase consists
+ * of k rows where the ith row has exactly i coins. The last row of the staircase may be incomplete.
+ *
+ * Given the integer n, return the number of complete rows of the staircase you will build.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var arrangeCoins = function(n) {
+  let count = 0;
+  for (; count <= n; count++) {
+    n -= count;
+  }
+  return count - 1;
+};