#843 · #3394 · Check if Grid can be Cut into Sections(判断网格图能否被切割成块)

You are given an integer n and a 2D array rectangles where rectangles[i] = [x1, y1, x2, y2] is an axis-aligned rectangle inside an n x n grid. Return true if you can make either two horizontal cuts or two vertical cuts that split the grid into three sections, each containing at least one rectangle, without cutting through any rectangle. Constraints: 3 <= n <= 10^9, 3 <= rectangles.length <= 10^5, 0 <= x1 < x2 <= n, 0 <= y1 < y2 <= n.