Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
This entry contains problem metadata. Read the source for the complete statement.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Operations to Transform Array into Alternating Prime
Coding · Array · Binary Search · Math
- Lexicographically Smallest Negated Permutation that Sums to Target
Coding · Array · Greedy · Math
- Largest Prime from Consecutive Prime Sum
Coding · Array · Math · Number Theory
- Minimize Array Sum Using Divisible Replacements
Coding · Array · Greedy · Hash Table
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
LeetCode · 1 record
No company association
Official problem listing
Sum of GCD of Formed Pairs
Source snapshot: Nov 13, 2026
Verified official problem metadata. This is not evidence of a recent interview ask.
View source
LeetCode company tags · 4 records
Amazon
Archived company tags
Sum of GCD of Formed Pairs
Source window: all_time
Source snapshot: Oct 20, 2026
Historical tags, not proof of a recent interview ask. Snapshot: 2026-10-20.
View sourceBloomberg
Archived company tags
Sum of GCD of Formed Pairs
Source window: all_time
Source snapshot: Oct 20, 2026
Historical tags, not proof of a recent interview ask. Snapshot: 2026-10-20.
View source