Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Find Subsequence of Length K With the Largest Sum
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Kth Largest Sum in a Binary Tree
Coding
- Largest Sum of Averages
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3556. Sum of Largest Prime Substrings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source