Add solution #1739

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,512 LeetCode solutions in JavaScript
+# 1,513 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1340,6 +1340,7 @@
 1736|[Latest Time by Replacing Hidden Digits](./solutions/1736-latest-time-by-replacing-hidden-digits.js)|Easy|
 1737|[Change Minimum Characters to Satisfy One of Three Conditions](./solutions/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js)|Medium|
 1738|[Find Kth Largest XOR Coordinate Value](./solutions/1738-find-kth-largest-xor-coordinate-value.js)|Medium|
+1739|[Building Boxes](./solutions/1739-building-boxes.js)|Hard|
 1748|[Sum of Unique Elements](./solutions/1748-sum-of-unique-elements.js)|Easy|
 1749|[Maximum Absolute Sum of Any Subarray](./solutions/1749-maximum-absolute-sum-of-any-subarray.js)|Medium|
 1752|[Check if Array Is Sorted and Rotated](./solutions/1752-check-if-array-is-sorted-and-rotated.js)|Easy|

solutions/1739-building-boxes.js

@@ -0,0 +1,38 @@
+/**
+ * 1739. Building Boxes
+ * https://leetcode.com/problems/building-boxes/
+ * Difficulty: Hard
+ *
+ * You have a cubic storeroom where the width, length, and height of the room are all equal to n
+ * units. You are asked to place n boxes in this room where each box is a cube of unit side
+ * length. There are however some rules to placing the boxes:
+ * - You can place the boxes anywhere on the floor.
+ * - If box x is placed on top of the box y, then each side of the four vertical sides of the box
+ *   y must either be adjacent to another box or to a wall.
+ *
+ * Given an integer n, return the minimum possible number of boxes touching the floor.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var minimumBoxes = function(n) {
+  if (n < 4) return n;
+
+  let baseSize = 0;
+  let totalBoxes = 0;
+  const triangular = k => k * (k + 1) / 2;
+
+  while (totalBoxes + triangular(baseSize + 1) <= n) {
+    baseSize++;
+    totalBoxes += triangular(baseSize);
+  }
+
+  const remaining = n - totalBoxes;
+  let extraFloor = 0;
+
+  while (triangular(extraFloor) < remaining) extraFloor++;
+
+  return triangular(baseSize) + extraFloor;
+};