Leetcode 3115. Maximum Prime Difference

Find the maximum index distance between any two prime numbers in the array — equivalently the gap between the first and last prime occurrences — given nums length up to 3×10^5 and values ≤100.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3115. Maximum Prime Difference

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact