Available question text
Compute the "clumsy factorial" by applying the operations *, /, +, - in a repeating cycle to the integers n down to 1, using standard precedence (multiplication/division before addition/subtraction) and floor division for '/'. The challenge is to simulate or exploit the repeating 4-number pattern to produce the final integer result efficiently.
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 1006. Clumsy Factorial
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source