Leetcode 1139. Largest 1-Bordered Square

Given a binary matrix, return the area of the largest square subgrid whose four borders are entirely 1s (interior may be 0), or 0 if none exists. The core challenge is efficiently validating border-only constraints for many candidate squares in a grid up to 100x100.