Skip to content

Practice Sum of Largest Prime Substrings

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3556
LeetCode Problem

Sum of Largest Prime Substrings

Problem Statement

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.

Source: Sum of Largest Prime Substrings on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "12234"
Output
1469

# Example 2

Input
s = "111"
Output
11

Constraints

1 <= s.length <= 10
s consists of only digits.

Related LeetCode Problems

Practice more problems similar to Sum of Largest Prime Substrings.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.