Maximum Points After Enemy Battles

Explore how to apply greedy algorithm strategies to maximize points by carefully managing energy through two types of operations. Understand when to expend energy to defeat enemies or regain energy by marking enemies. This lesson helps you develop optimal decision-making skills for energy-based problem solving in coding interviews.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

Statement

You are given an integer array enemyEnergies where each element represents the energy value of an enemy, and an integer currentEnergy representing your initial energy.

You start with $0$ points, and all enemies are initially unmarked. You may perform either of the following operations any number of times to accumulate points:

Operation 1 — Choose an unmarked enemy i such that currentEnergy >= enemyEnergies[i]:

Your points increase by $1$ .
Your energy decreases: currentEnergy = currentEnergy - ...