Return to Question

###A second example test case

A second example test case

Should yield

[1, 0, 2, 2]

(...not [1, 0, 3, 1] or [3, 2, 5, 3] both of which also have area six)

Should yield one of these three coordinate lists identifying an area six rectangles:

[1, 0, 2, 2]
[1, 0, 3, 1]
[3, 2, 5, 3]

• The goal is to found the "first" valid rectangle with the largest area
• If there are multiple rectangles with the same maximum area, output one with (top coordinate, left coordinate, bottom coordinate, right coordinate) lexicographically smallest.
• To calculate area for (1,0) to (4,3) you do (4-1)*(3-0).
• Rectangles must have edges parallel to the board's edge.
• The board has, at least, one non-zero area rectangle.
• Each letter is a printable ASCII char from A to Z (both included).

• The goal is to find the rectangle or one of the rectangles with the largest area, calculated by (right-left+1)*(bottom-top+1)
• If there are multiple rectangles with the same maximum area, output any one. Optionally the one with (top coordinate, left coordinate, right coordinate, bottom coordinate) lexicographically smallest.
• Rectangles must have edges parallel to the board's edge.
• Each letter is a printable ASCII char from A to Z (both included).