#948

Bag of Tokens

specialist · 735 · lc medium +31 · 59.5% accepted · 3,462 likes · top 57%

⚑ Converging Pointers (Pair / Triple Sum)

Description

Starting with power units and score 0, you have an array tokens. Each token may be played face-up (spend tokens[i] power, gain one point) or face-down (spend one point, gain tokens[i] power), but each token is used at most once. Return the highest score achievable.

Code

1

2

3

class Solution:
    def bagOfTokensScore(self, tokens: List[int], power: int) -> int:

class Solution:
    def bagOfTokensScore(self, tokens: List[int], power: int) -> int: