Practice Four Divisors
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an integer array nums, return the sum of divisors of the integers in that array that have exactly four divisors. If there is no such integer in the array, return 0.
Source: Four Divisors on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [21,4,7]
Output
32
# Example 2
Input
nums = [21,21]
Output
64
# Example 3
Input
nums = [1,2,3,4,5]
Output
0
Constraints
1 <= nums.length <= 10^4
1 <= nums[i] <= 10^5
Related LeetCode Problems
Practice more problems similar to Four Divisors.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.