Available question text
Given an array of integers (n up to 10^4, values up to 10^5), find elements that have exactly four divisors—which occur only for p^3 or a product of two distinct primes—and return the sum of all their divisors.
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 1390. Four Divisors
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source