JavaScript

Previously, we explored the fixed-length sliding window technique, which typically involves sliding a window of constant size by one element at a time. For a detailed explanation, refer to the article —— 📝How to Solve Fixed-Length Sliding Window Problems. Now, we encounter a new class of problems that also appear solvable with a sliding window approach, but with a crucial difference: the window size is variable. Find the Longest Subarray Given a string s, find the length of the longest substring without duplicate characters. ...

We previously learned about the fixed-length sliding window technique, which typically involves sliding one element at a time. For a detailed explanation, refer to the article —— 📝How to Solve Fixed-Length Sliding Window Problems. Now, we encounter a new problem that also appears solvable with a sliding window, but with a slight twist🔗. A Tricky Problem There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints. ...

One Classic Problem Given an integer array nums consisting of n elements, and an integer k, find the maximum sum of any contiguous subarray of size k. Example: Input: arr = [2, 1, 5, 1, 3, 2], k = 3 Output: 9 Explanation: Subarray [5, 1, 3] has the maximum sum 9 Constraints: $n == nums.length$ $1 <= k <= n <= 10^5$ $-10^4 <= nums[i] <= 10^4$ Brute Force Approach The simplest solution checks each subarray independently: ...