1423. Maximum Points You Can Obtain From Cards | Leetcode | Medium | Java | Sliding Window

This problem is related to sliding window and two pointers, this question revolves around finding a window which consists of cards which are not included or picked. As finding this window is easier and possible, and eventually calculating the sum of k cards which can be included.
Link to the question: leetcode.com/p...
Other problems for practice:
• Number of Substrings C...
• Binary Subarrays With ...
• Max Consecutive Ones I...
• Sum of Subarray Ranges...
• Sum of Subarray Minimu...
• Expression Add operato...
• Word Search | Leetcode...
• Letter combinations of...