Maximum Total Damage With Spell Casting — Algorithm Visualization & Coding Challenge

Choose Your Learning Path

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.

🧠 Active Learning

Visualize the algorithm step-by-step with interactive animations in real time.

📖 Passive Learning

Read the full explanation, examples, and starter code at your own pace.

🎯 Challenge Mode

Drag and arrange the algorithm steps in the correct execution order.

🧠 Select Active to activate

JUMP INTO VISUALIZATION

Watch algorithms run step by step.

Follow every state change, comparison, and transformation as the execution unfolds in real time.

📖 Select Passive to activate

Understanding Maximum Total Damage With Spell Casting

Detailed explanation and reference materials

Problem Overview

Maximum Total Damage With Spell Casting

Medium
Topics: Dynamic Programming, Hashing, Sorting

🧙 Problem Description

A magician has various spells.

You are given an array power, where each element represents the damage of a spell.
Multiple spells can have the same damage value.

It is a known fact that if a magician decides to cast a spell with a damage of power[i],
they cannot cast any spell with a damage of power[i] - 2, power[i] - 1, power[i] + 1, or power[i] + 2.

Each spell can be cast only once.

Return the maximum possible total damage that a magician can cast.

🧩 Example 1

Input: power = [1,1,3,4]
Output: 6

Explanation:
The maximum possible damage of 6 is produced by casting spells 0, 1, 3 with damage 1, 1, and 4.

🧩 Example 2

Input: power = [7,1,6,6]
Output: 13

Explanation:
The maximum possible damage of 13 is produced by casting spells 1, 2, 3 with damage 1, 6, and 6.

📋 Constraints

1 <= power.length <= 10^5
1 <= power[i] <= 10^9

— Written by Saurabh Patil • B.Tech CSE • Software Developer

Reference Link

https://leetcode.com/problems/maximum-total-damage-with-spell-casting/description/

Loading component...

Starter Code

Test, modify, or copy the starter code. Click "Visualize" to import into the canvas.

Java

Output:

Understood Algorithm, Test Me now 🎮

🎯 Select Challenge to activate

🧠 Logic Puzzle

Think & Arrange, Don't Just Copy-Paste

Drag and arrange the algorithm steps in the correct execution order instead of spending time typing code letter by letter.

Arrange the Algorithm Correctly 🧩

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 Algorithm

Green text means the instruction is placed in the correct position.

Red text means the instruction is in the wrong position.

Block Colors

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.