Add solution #2560

Author: JoshCrozier

README.md

@@ -837,6 +837,7 @@
 2535|[Difference Between Element Sum and Digit Sum of an Array](./2535-difference-between-element-sum-and-digit-sum-of-an-array.js)|Easy|
 2542|[Maximum Subsequence Score](./2542-maximum-subsequence-score.js)|Medium|
 2559|[Count Vowel Strings in Ranges](./2559-count-vowel-strings-in-ranges.js)|Medium|
+2560|[House Robber IV](./2560-house-robber-iv.js)|Medium|
 2570|[Merge Two 2D Arrays by Summing Values](./2570-merge-two-2d-arrays-by-summing-values.js)|Easy|
 2579|[Count Total Number of Colored Cells](./2579-count-total-number-of-colored-cells.js)|Medium|
 2618|[Check if Object Instance of Class](./2618-check-if-object-instance-of-class.js)|Medium|

solutions/2560-house-robber-iv.js

@@ -0,0 +1,59 @@
+/**
+ * 2560. House Robber IV
+ * https://leetcode.com/problems/house-robber-iv/
+ * Difficulty: Medium
+ *
+ * There are several consecutive houses along a street, each of which has some money inside.
+ * There is also a robber, who wants to steal money from the homes, but he refuses to steal
+ * from adjacent homes.
+ *
+ * The capability of the robber is the maximum amount of money he steals from one house of
+ * all the houses he robbed.
+ *
+ * You are given an integer array nums representing how much money is stashed in each house.
+ * More formally, the ith house from the left has nums[i] dollars.
+ *
+ * You are also given an integer k, representing the minimum number of houses the robber will
+ * steal from. It is always possible to steal at least k houses.
+ *
+ * Return the minimum capability of the robber out of all the possible ways to steal at least
+ * k houses.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var minCapability = function(nums, k) {
+  let left = Math.min(...nums);
+  let right = Math.max(...nums);
+
+  while (left < right) {
+    const mid = Math.floor((left + right) / 2);
+
+    if (canRob(nums, mid, k)) {
+      right = mid;
+    } else {
+      left = mid + 1;
+    }
+  }
+
+  return left;
+};
+
+function canRob(nums, capability, k) {
+  let count = 0;
+  let i = 0;
+
+  while (i < nums.length) {
+    if (nums[i] <= capability) {
+      count++;
+      i += 2;
+    } else {
+      i++;
+    }
+  }
+
+  return count >= k;
+}