🛄 Day 24

Author: AkashRajpurohit

README.md

@@ -39,6 +39,7 @@
 
 1. [Minimum Depth of Binary Tree](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3504/) ➡️ [CPP Solution](Week4/minDepth.cpp)
 2. [132 Pattern](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3505/) ➡️ [CPP Solution](Week4/find132pattern.cpp)
+3. [Bag of Tokens](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/562/week-4-october-22nd-october-28th/3506/) ➡️ [CPP Solution](Week4/bagOfTokensScore.cpp)
 
 ## Week 5 🚧
 

Week4/bagOfTokensScore.cpp

@@ -0,0 +1,26 @@
+class Solution {
+public:
+    int bagOfTokensScore(vector<int>& tokens, int P) {
+        int n = tokens.size();
+        if(n == 0) return 0;
+        
+        sort(tokens.begin(), tokens.end());
+        
+        int i = 0, j = n - 1, score = 0, maxScore = 0;
+        
+        while(i <= j) {
+            if(tokens[i] <= P) {
+                P -= tokens[i++];
+                score++;
+                maxScore = max(maxScore, score);
+            } else if(score > 0) {
+                P += tokens[j--];
+                score--;
+            } else {
+                return maxScore;
+            }
+        }
+        
+        return maxScore;
+    }
+};