Available question text
Given an integer array, count triplets of indices (i, j, k) such that exactly one element of the triplet divides both of the other two. Solve efficiently by leveraging value frequencies and enumerating divisors/multiples (rather than checking all O(n^3) triplets) to compute combinatorial counts.
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 2198. Number of Single Divisor Triplets
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source