2083. Three Divisors
My accepted Python solution to LeetCode problem 2083, Three Divisors, running in 3ms.
- Difficulty: Easy
- Python
- Runtime 3ms
- Memory 17.2MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 3ms, memory 17.2MB, accepted 2025-12-31.
class Solution:
def isThree(self, n: int) -> bool:
count = 0
for i in range(1, n + 1):
if n % i == 0:
count += 1
if count > 3:
return False
return count == 3