Skip to content
This repository was archived by the owner on Jul 2, 2024. It is now read-only.

Conversation

shorodilov
Copy link
Member

Brick Wall Challenge

Added brick wall challenge. Original problem set is published at:
https://leetcode.com/problems/brick-wall/

Project Itself

  • Moved project dependencies to dev-section. Project has dev-deps only.
  • From now pip package manage is supported as well.
  • Removed legacy documentation section from README

* Added pip manager support

Added requirements file. Packages hashes are omitted to avoid issue with the newest pip version.
Updated readme file with instruction on how to operate using pip.
"Brick wall" is a basic-level challenge for working with data structures.
The original challenge: https://leetcode.com/problems/brick-wall/

There is a rectangular brick wall in front of you with n rows of
bricks. The ith row has some number of bricks each of the same height
(i.e., one unit) but they can be of different widths. The total width
of each row is the same.

Draw a vertical line from the top to the bottom and cross the least
bricks. If your line goes through the edge of a brick, then the brick
is not considered as crossed. You cannot draw a line just along one of
the two vertical edges of the wall, in which case the line will
obviously cross no bricks.

Given the 2D array wall that contains the information about the wall,
return the minimum number of crossed bricks after drawing such
a vertical line.
Updated project dependencies. From this moment all dependencies are dev-only.
@shorodilov shorodilov changed the title Release 2023.01.1 Release 2023.01.2 Jan 31, 2023
@shorodilov shorodilov merged commit 938645a into master Jan 31, 2023
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant