Available question text
Given two exchange graphs (day1 and day2) with multiplicative rates (each edge is invertible), find the maximum amount of the starting currency obtainable by doing any sequence of conversions on day1 followed by any on day2. This reduces to computing, for every currency, the maximum product reachable from the start in day1 and the maximum product back to the start in day2, then taking the best combined multiplier.
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 3387. Maximize Amount After Two Days of Conversions
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source