Available question text
Given 12 scoring zones and a limited number of arrows, choose which zones to strictly outshoot Alice in (each zone i requires aliceArrows[i]+1 arrows) to maximize the sum of their scores — a 0/1 knapsack/subset-selection problem over 12 items. Return any arrows allocation that achieves the maximum total points and sums to numArrows.
Related questions
Continue with questions that share topics or the same question type.
- Find the Minimum and Maximum Number of Nodes Between Critical Points
Coding
- Maximum Number of Groups Entering a Competition
Coding
- Maximum Number of Points From Grid Queries
Coding · Array · Breadth-First Search · Heap (Priority Queue)
- Maximum Number of Points with Cost
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2212. Maximum Points in an Archery Competition
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source