Sum of Largest Prime Substrings - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3556. Sum of Largest Prime Substrings
Medium
30 Points
Hash Table
Math
String
Sorting
Number Theory
Given a string s, find the sum of the 3 largest unique prime numbers that can be formed using any of its substrings.
Return the sum of the three largest unique prime numbers that can be formed. If fewer than three exist, return the sum of all available primes. If no prime numbers can be formed, return 0.
Note: Each prime number should be counted only once, even if it appears in multiple substrings. Additionally, when converting a substring to an integer, any leading zeros are ignored.
Examples
Example 1
Input: s = "12234"
Output: 1469
Explanation:
Example 2
Input: s = "111"
Output: 11
Explanation:
Constraints
1 <= s.length <= 10
s consists of only digits.
3556. Sum of Largest Prime Substrings
Medium
30 Points
Hash Table
Math
String
Sorting
Number Theory
Given a string s, find the sum of the 3 largest unique prime numbers that can be formed using any of its substrings.
Return the sum of the three largest unique prime numbers that can be formed. If fewer than three exist, return the sum of all available primes. If no prime numbers can be formed, return 0.
Note: Each prime number should be counted only once, even if it appears in multiple substrings. Additionally, when converting a substring to an integer, any leading zeros are ignored.