Add solution #554

Author: JoshCrozier

README.md

@@ -439,6 +439,7 @@
 551|[Student Attendance Record I](./0551-student-attendance-record-i.js)|Easy|
 552|[Student Attendance Record II](./0552-student-attendance-record-ii.js)|Hard|
 553|[Optimal Division](./0553-optimal-division.js)|Medium|
+554|[Brick Wall](./0554-brick-wall.js)|Medium|
 557|[Reverse Words in a String III](./0557-reverse-words-in-a-string-iii.js)|Easy|
 560|[Subarray Sum Equals K](./0560-subarray-sum-equals-k.js)|Medium|
 563|[Binary Tree Tilt](./0563-binary-tree-tilt.js)|Easy|

solutions/0554-brick-wall.js

@@ -0,0 +1,36 @@
+/**
+ * 554. Brick Wall
+ * https://leetcode.com/problems/brick-wall/
+ * Difficulty: Medium
+ *
+ * There is a rectangular brick wall in front of you with n rows of bricks. The ith row has
+ * some number of bricks each of the same height (i.e., one unit) but they can be of different
+ * widths. The total width of each row is the same.
+ *
+ * Draw a vertical line from the top to the bottom and cross the least bricks. If your line
+ * goes through the edge of a brick, then the brick is not considered as crossed. You cannot
+ * draw a line just along one of the two vertical edges of the wall, in which case the line
+ * will obviously cross no bricks.
+ *
+ * Given the 2D array wall that contains the information about the wall, return the minimum
+ * number of crossed bricks after drawing such a vertical line.
+ */
+
+/**
+ * @param {number[][]} wall
+ * @return {number}
+ */
+var leastBricks = function(wall) {
+  const map = new Map();
+  let max = 0;
+
+  for (const row of wall) {
+    for (let i = 0, sum = 0; i < row.length - 1; i++) {
+      sum += row[i];
+      map.set(sum, (map.get(sum) || 0) + 1);
+      max = Math.max(max, map.get(sum));
+    }
+  }
+
+  return wall.length - max;
+};