Available question text
Pair up the 2n integers and assign an operation order to maximize the sum of i * gcd(x,y) over n operations (each operation removes a chosen pair). With n ≤ 7 this is a combinatorial optimization over pairings typically solved via bitmask DP or memoized subset recursion.
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 1799. Maximize Score After N Operations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source