Add solution #3394

Author: JoshCrozier

README.md

@@ -1004,6 +1004,7 @@
 3306|[Count of Substrings Containing Every Vowel and K Consonants II](./solutions/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.js)|Medium|
 3356|[Zero Array Transformation II](./solutions/3356-zero-array-transformation-ii.js)|Medium|
 3392|[Count Subarrays of Length Three With a Condition](./solutions/3392-count-subarrays-of-length-three-with-a-condition.js)|Easy|
+3394|[Check if Grid can be Cut into Sections](./solutions/3394-check-if-grid-can-be-cut-into-sections.js)|Medium|
 3396|[Minimum Number of Operations to Make Elements in Array Distinct](./solutions/3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js)|Easy|
 3397|[Maximum Number of Distinct Elements After Operations](./solutions/3397-maximum-number-of-distinct-elements-after-operations.js)|Medium|
 3402|[Minimum Operations to Make Columns Strictly Increasing](./solutions/3402-minimum-operations-to-make-columns-strictly-increasing.js)|Easy|

solutions/3394-check-if-grid-can-be-cut-into-sections.js

@@ -0,0 +1,39 @@
+/**
+ * 3394. Check if Grid can be Cut into Sections
+ * https://leetcode.com/problems/check-if-grid-can-be-cut-into-sections/
+ * Difficulty: Medium
+ *
+ * You are given an integer n representing the dimensions of an n x n grid, with the origin at the
+ * bottom-left corner of the grid. You are also given a 2D array of coordinates rectangles, where
+ * rectangles[i] is in the form [startx, starty, endx, endy], representing a rectangle on the grid.
+ * Each rectangle is defined as follows:
+ * - (startx, starty): The bottom-left corner of the rectangle.
+ * - (endx, endy): The top-right corner of the rectangle.
+ *
+ * Note that the rectangles do not overlap. Your task is to determine if it is possible to make
+ * either two horizontal or two vertical cuts on the grid such that:
+ * - Each of the three resulting sections formed by the cuts contains at least one rectangle.
+ * - Every rectangle belongs to exactly one section.
+ *
+ * Return true if such cuts can be made; otherwise, return false.
+ */
+
+/**
+ * @param {number} n
+ * @param {number[][]} rectangles
+ * @return {boolean}
+ */
+var checkValidCuts = function(n, rectangles) {
+  return canPartition(rectangles.map(r => [r[0], r[2]]))
+    || canPartition(rectangles.map(r => [r[1], r[3]]));
+};
+
+function canPartition(intervals, cuts = 0) {
+  intervals.sort(([start1, end1], [start2, end2]) => start1 - start2 || end2 - end1);
+  let maxReach = intervals[0][1];
+  for (let i = 1; i < intervals.length; i++) {
+    if (intervals[i][0] >= maxReach && ++cuts === 2) return true;
+    maxReach = Math.max(intervals[i][1], maxReach);
+  }
+  return false;
+}