Add solution #361

Author: JoshCrozier

README.md

@@ -349,6 +349,7 @@
 358|[Rearrange String k Distance Apart](./solutions/0358-rearrange-string-k-distance-apart.js)|Hard|
 359|[Logger Rate Limiter](./solutions/0359-logger-rate-limiter.js)|Easy|
 360|[Sort Transformed Array](./solutions/0360-sort-transformed-array.js)|Medium|
+361|[Bomb Enemy](./solutions/0361-bomb-enemy.js)|Medium|
 363|[Max Sum of Rectangle No Larger Than K](./solutions/0363-max-sum-of-rectangle-no-larger-than-k.js)|Hard|
 365|[Water and Jug Problem](./solutions/0365-water-and-jug-problem.js)|Medium|
 367|[Valid Perfect Square](./solutions/0367-valid-perfect-square.js)|Easy|

solutions/0361-bomb-enemy.js

@@ -0,0 +1,46 @@
+/**
+ * 361. Bomb Enemy
+ * https://leetcode.com/problems/bomb-enemy/
+ * Difficulty: Medium
+ *
+ * Given an m x n matrix grid where each cell is either a wall 'W', an enemy 'E' or empty '0',
+ * return the maximum enemies you can kill using one bomb. You can only place the bomb in an
+ * empty cell.
+ *
+ * The bomb kills all the enemies in the same row and column from the planted point until it
+ * hits the wall since it is too strong to be destroyed.
+ */
+
+/**
+ * @param {character[][]} grid
+ * @return {number}
+ */
+var maxKilledEnemies = function(grid) {
+  const rows = grid.length;
+  const cols = grid[0].length;
+  const colHits = new Array(cols).fill(0);
+  let rowHits = 0;
+  let result = 0;
+
+  for (let i = 0; i < rows; i++) {
+    for (let j = 0; j < cols; j++) {
+      if (j === 0 || grid[i][j-1] === 'W') {
+        rowHits = 0;
+        for (let k = j; k < cols && grid[i][k] !== 'W'; k++) {
+          if (grid[i][k] === 'E') rowHits++;
+        }
+      }
+      if (i === 0 || grid[i-1][j] === 'W') {
+        colHits[j] = 0;
+        for (let k = i; k < rows && grid[k][j] !== 'W'; k++) {
+          if (grid[k][j] === 'E') colHits[j]++;
+        }
+      }
+      if (grid[i][j] === '0') {
+        result = Math.max(result, rowHits + colHits[j]);
+      }
+    }
+  }
+
+  return result;
+};