Available question text
Count the number of index pairs i < j such that the first digit of nums[i] and the last digit of nums[j] are coprime (gcd == 1). Reduce each number to its leading and trailing digit (digits ∈ 1..9) and count pairs satisfying the coprimality condition.
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 2748. Number of Beautiful Pairs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source