3394. Check if Grid can be Cut into Sections

Given an n×n field and non-overlapping rectangles=[x1,y1,x2,y2]. Decide whether two horizontal OR two vertical grid-aligned cuts can split the field into 3 parts, each containing ≥1 rectangle,…