Available question text
Given unique integers >1 (n ≤ 1000), count binary trees (values may be reused) where every non-leaf node equals the product of its children; compute for each value the number of trees rooted at it using DP by summing contributions from factor pairs present in the array, with the result modulo 1e9+7.
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 823. Binary Trees With Factors
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source