maximum-sum-of-three-numbers-divisible-by-three

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code>.

Your task is to choose exactly three integers from <code>nums</code> such that their sum is divisible by three.

Return the maximum possible sum of such a triplet. If no such triplet exists, return 0.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [4,2,3,1]

Output: 9

Explanation:

The valid triplets whose sum is divisible by 3 are:

<ul>
	<li><code>(4, 2, 3)</code> with a sum of <code>4 + 2 + 3 = 9</code>.</li>
	<li><code>(2, 3, 1)</code> with a sum of <code>2 + 3 + 1 = 6</code>.</li>
</ul>

Thus, the answer is 9.
</div>

Example 2:

<div class="example-block">
Input: nums = [2,1,5]

Output: 0

Explanation:

No triplet forms a sum divisible by 3, so the answer is 0.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>3 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
</ul>

Biweekly Contest 172

biweekly-contest-172

maximumSum

Senior

Maximum Sum of Three Numbers Divisible by Three

Array

Greedy

Sorting

Heap (Priority Queue)

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

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: 9

Explanation:

The valid triplets whose sum is divisible by 3 are:

 * (4, 2, 3) with a sum of 4 + 2 + 3 = 9.
 * (2, 3, 1) with a sum of 2 + 3 + 1 = 6.

Thus, the answer is 9.

Example 2:

Input: nums = [2,1,5]

Output: 0

Explanation:

No triplet forms a sum divisible by 3, so the answer is 0.

 

Constraints:

 * 3 <= nums.length <= 105
 * 1 <= nums[i] <= 105