Available question text
Given a bottom string and a list of allowed triples where each pair of adjacent blocks maps to one or more possible top blocks, determine whether you can build a single-block pyramid by repeatedly stacking allowed tops over each adjacent pair. The core challenge is exploring the exponential space of possible upper rows (backtracking/DFS, often with memoization/pruning) to find a sequence of valid rows up to the apex.
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 756. Pyramid Transition Matrix
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source