Available question text
Given n units and n-1 directed conversion edges that guarantee a unique path from unit 0 to every other unit, compute for each unit the product of conversion factors along the path from 0 to that unit, returning each product modulo 10^9+7 — essentially a tree traversal that accumulates multiplicative weights.
Related questions
Continue with questions that share topics or the same question type.
- Unit Conversion II
Coding
- Analyze Subscription Conversion
Coding
- Hexadecimal and Hexatrigesimal Conversion
Coding
- Write SQL for post-trial conversion cohorts
Coding · Experiment Analysis & Readout
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 3528. Unit Conversion I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source