How would you like to learn today?
Visualize algorithms in real time, explore them step by step, or challenge yourself with a test.Choose a path to focus—or scroll down to preview all options.
Visualize the algorithm step-by-step with interactive animations in real time.
Read the full explanation, examples, and starter code at your own pace.
Drag and arrange the algorithm steps in the correct execution order.
🧠 Select Active to activate
Follow every state change, comparison, and transformation as the execution unfolds in real time.
📖 Select Passive to activate
Difficulty: Medium
Topics: (array, dynamic-programming)
Companies: (premium)
Hint: Given an integer array \(nums\), return the maximum possible sum of elements of the array such that it is divisible by three.
Given an integer array nums, return the maximum possible sum of elements of the array such that it is divisible by three.
Example 1:
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).
Example 2:
Input:
nums = [4]
Output:
0
Explanation: Since 4 is not divisible by 3, do not pick any number.
Example 3:
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).
1 <= nums.length <= 4 * 10^4
1 <= nums[i] <= 10^4
🎯 Select Challenge to activate
Drag and arrange the algorithm steps in the correct execution order instead of spending time typing code letter by letter.
The algorithm is divided into three logical parts. Carefully rearrange each section in the correct order to form a complete and valid solution.
Understand Below AlgorithmGreen text means the instruction is placed in the correct position.
Red text means the instruction is in the wrong position.
Instructions with the same background color indicate particular blocks start and end.
A tick mark means the instruction is correct and locked.
🔒 Locked steps cannot be moved. Only unlocked steps are draggable.
🔊 Enable sound for swap feedback and completion effects.