Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Maximum Points After Enemy Battles

Explore how to optimize your points in enemy battles by applying greedy algorithms. This lesson teaches you to strategically choose operations that manage energy and points to get the highest score possible.

We'll cover the following...

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 00 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 11.

  • Your energy decreases: currentEnergy = currentEnergy - ...