Maximizing Card Point Sum With Two Pointers Approach
Maximizing score with k card picks: use two pointers to track left and right sums, updating max sum as needed.
Problem
this falls under pattern 1: since the window size is constant
We will be using two pointers left and right
class Solution {
public int maxScore(int[] cardPoints, int k) {
//we can pick elements from left or right but the length of the picked elements should equal to k only
int sum = 0;
//initially we assume the max sum to be sum of k elements from the left
for(int left =0;left<k;left++){
sum+=cardPoints[left];
}
int maxSum = sum;
//after this we will try to find out if addition of any element from the right end wi...