Leetcode 3556. Sum of Largest Prime Substrings

Enumerate all numeric values from s's substrings (ignoring leading zeros), deduplicate and test each for primality. Return the sum of the three largest unique primes found (or the sum of all found, or 0 if none).

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 3556. Sum of Largest Prime Substrings

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact