Rectangle Fit Queries

Process the rows of operations from left to right. Each row has one of two forms:
[0, a, b]: create and save a rectangle of size a × b.
[1, a, b]: determine whether every rectangle saved by earlier operations can fit inside a box of size a × b.
Test each saved rectangle separately; the rectangles do not need to fit in the box at the same time. You may rotate a rectangle by 90 degrees.
Return one boolean for each query operation, in query order.

Function
solution(operations: int[][]) → boolean[]

Examples
Example 1
operations = [[1,1,1]]
return = [true]
No rectangles have been saved, so every saved rectangle vacuously fits and the answer is true.
Example 2
operations = [[0,1,3],[0,4,2],[1,3,4],[1,3,2]]
return = [true,false]
Both saved rectangles fit the 3 × 4 box after choosing the appropriate orientation. The 4 × 2 rectangle cannot fit the later 3 × 2 box, so the answers are [true,false].

Constraints
operations contains at least one row.
operations[i].length = 3.
operations[i][0] is either 0 or 1.
operations[i][1] and operations[i][2] are positive integers.

Normalize every rectangle so its sides are (small, large). A rectangle fits a box if, after normalizing the box the same way, small <= boxSmall and large <= boxLarge. For all saved rectangles to fit, you need the maximum of all the small sides to be <= the box's small side, and the maximum of all the large sides to be <= the box's large side. So keep two variables, maxSmall and maxLarge, both starting at 0. On a type 0 op, update both with min(a,b) and max(a,b). On a type 1 op, append maxSmall <= min(a,b) and maxLarge <= max(a,b). Empty case returns true for free because the maxes are 0. The common pitfall is comparing a to a and b to b without normalizing, or storing every rectangle and rescanning, which is O(n^2). Another trap is taking the max of raw widths and heights separately. Each op is O(1), so the whole thing is O(n). If you freeze under the clock, StealthCoder is there as the safety net.

Memorize the pattern. If you can't, run StealthCoder. The proctor sees the IDE. They don't see what's behind it.