Available question text
Given a line of dominoes where some are initially pushed left (L), right (R), or upright (.), compute the final positions after simultaneous propagation of forces. The core challenge is resolving interactions in segments between fixed pushes (e.g., R...L where forces meet and split, or R...R / L...L that propagate fully), which can be done in linear time by scanning and handling each interval.
Related questions
Continue with questions that share topics or the same question type.
- Longest Palindromic Substring
Coding · Dynamic Programming · Manacher · String
- Palindromic Substrings
Coding · Dynamic Programming · String · Two Pointers
- Count Binary Substrings
Coding · String · Two Pointers
- Decode Ways
Coding · Dynamic Programming · String
Sources · 2 references
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 838. Push Dominoes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Anduril
Push Dominoes
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 65.6. This is not an interview probability.
View source