Search
⌘K

Leetcode 554. Brick Wall

Given rows of brick widths with equal total width, find a vertical line (not on the two outer edges) that crosses the fewest bricks — equivalently, locate the x-coordinate where the most brick boundaries align by counting cumulative edge positions across rows and subtracting that maximum from the number of rows.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.