PreviousNext
Coding/Searching and sorting

Brick wall minimum crosses

Write codeMedium25 min

Your task

A brick wall is a list of rows; each row is a list of positive brick widths, and all rows sum to the same total width. You want to draw a single vertical line from top to bottom that crosses the FEWEST bricks (a line along a brick's edge does not cross it). The line cannot be drawn along the wall's far-left or far-right edge. Return the minimum number of bricks crossed.

Examples

least_bricks(wall: list[list[int]]) -> int
Example 1
Inputleast_bricks([[1, 2, 2, 1], [3, 1, 2], [1, 3, 2], [2, 4], [3, 1, 2], [1, 3, 1, 1]])
Output2