greatest-sum-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

Given an integer array <code>nums</code>, return the maximum possible sum of elements of the array such that it is divisible by three.

&nbsp;
Example 1:

<pre>
Input: nums = [3,6,5,1,8]
Output: 18
Explanation: Pick numbers 3, 6, 1 and 8 their sum is 18 (maximum sum divisible by 3).</pre>

Example 2:

<pre>
Input: nums = [4]
Output: 0
Explanation: Since 4 is not divisible by 3, do not pick any number.
</pre>

Example 3:

<pre>
Input: nums = [1,2,3,4,4]
Output: 12
Explanation: Pick numbers 1, 3, 4 and 4 their sum is 12 (maximum sum divisible by 3).
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 4 * 104</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 104</code></li>
</ul>

Weekly Contest 163

weekly-contest-163

maxSumDivThree

Staff

Greatest Sum Divisible by Three

Array

Dynamic Programming

Greedy

Sorting

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs