3373. Maximum Prime Difference
My accepted Python solution to LeetCode problem 3373, Maximum Prime Difference, running in 883ms.
- Difficulty: Medium
- Python
- Runtime 883ms
- Memory 26.5MB
- 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 883ms, memory 26.5MB, accepted 2026-01-01.
class Solution:
def maximumPrimeDifference(self, nums: List[int]) -> int:
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, int(n**0.5) + 1, 2):
if n % i == 0:
return False
return True
first_prime = -1
last_prime = -1
for i, num in enumerate(nums):
if is_prime(num):
if first_prime == -1:
first_prime = i
last_prime = i
return last_prime - first_prime