Maximum Sum of Three Numbers Divisible by Three
You are given an integer array nums.
Your task is to choose exactly three integers from nums such that their sum is divisible by three.
Return the maximum possible sum of such a triplet. If no such triplet exists, return 0.
Example 1
Input
nums = [4,2,3,1]Output
9The valid triplets divisible by 3 have sums 9 and 6, so the maximum is 9.
Example 2
Input
nums = [2,1,5]Output
0No triplet forms a sum divisible by 3, so the answer is 0.
Constraints
- 3 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^5