Available question text
Given Alice's fixed length-n sequence of moves in a rock-paper-scissors cycle (F beats E, W beats F, E beats W), count how many length-n sequences Bob can play (never repeating the same creature in consecutive rounds) that give Bob a strictly higher total score than Alice, modulo 1e9+7. The core challenge is counting constrained sequences, typically solved by dynamic programming that tracks the round index, Bob's last move, and the running score difference.
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 3320. Count The Number of Winning Sequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source