FastPrepMaximize Monsters Defeated
Problems/Maximize Monsters Defeated

Maximize Monsters Defeated

Salesforce logoSalesforce● MediumFULLTIMEONSITE INTERVIEW
QuestionFunctionExamplesConstraints

Problem statement

Source note: The reported task identifies this algorithmic exercise. The executable interface, bounds, deterministic tie rules, and examples are the documented practice contract.

Defeating monster i consumes bulletRequirements[i] bullets and one poison dose. Each monster may be defeated at most once.

Given the available bullets and poison doses, return the maximum number of monsters that can be defeated.

Function

maximizeMonstersDefeated(bulletRequirements: int[], availableBullets: int, poisonDoses: int) → int

Examples

Example 1

bulletRequirements = [4,2,7,1]availableBullets = 7poisonDoses = 3return = 3

Case 1 exercises the documented deterministic contract.

Example 2

bulletRequirements = [5,6]availableBullets = 20poisonDoses = 1return = 1

Case 2 exercises the documented deterministic contract.

Example 3

bulletRequirements = [1,1,1]availableBullets = 2poisonDoses = 3return = 2

Case 3 exercises the documented deterministic contract.

Constraints

  • 1 <= bulletRequirements.length <= 200000.
  • 0 <= bulletRequirements[i], availableBullets <= 10^9.
  • 0 <= poisonDoses <= bulletRequirements.length.

More Salesforce problems

  • Count Subarrays With Product Equal to KOA · Seen Nov 2026
  • Minimum No-Repeat Segments After One Character RemovalOA · Seen Nov 2026
  • Get Message StatusOA · Seen Nov 2026
All Salesforce interview questionsSee Salesforce hiring insights
Saved
class Solution {
    public int maximizeMonstersDefeated(int[] bulletRequirements, int availableBullets, int poisonDoses) {
        // Write your code here.
    }

}
Checking account…