Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2088. Count Fertile Pyramids in a Land
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source