Search
⌘K
Get Premium
Leetcode 2088. Count Fertile Pyramids in a Land
Given an m x n binary grid, count all upward- and downward-pointing isosceles triangular regions made entirely of 1s (pyramids/inverse pyramids) with height > 1, where each row down/up expands one cell on each side. Return the total number of such pyramidal plots in the grid.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.