NeetCode #125LC-838MediumArrays & Hashing
← Back to All Problems#125 · #838 · Push Dominoes(推多米诺)
📌 Problem Statement & Constraints
Given a string
dominoes where dominoes[i] is 'L', 'R' or '.', return the final state after all falling dominoes settle. A domino pushed left forces its left neighbour to fall left, and so on; when an 'R' and an 'L' meet, the ones between them stay upright. Constraints: 1 <= dominoes.length <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!