Sliding Window

Sliding Window

Master sliding window technique for array problems

11 Problems

Beginner

All Problems

11 problems

Sliding Window Introduction Identification And Types - Intro 1

Given an array of integers Arr and a number k, return the maximum sum of a subarray of size k using a brute force approach.

Sliding Window Introduction Identification And Types - Intro 2

Given an array of integers Arr and a number k, return the maximum sum of a subarray of size k using a brute force approach.

Maximum Sum Subarray of size K

Given an array of integers Arr and a number k, return the maximum sum of a subarray of size k.

First Negative Integer in Every Window of Size K

Given an array and a positive integer k, find the first negative number in every window of size k. If a window does not contain a negative number, print 0 for that window.

Count Occurrences of Anagrams

Given a word and a text, return the count of occurrences of anagrams of the word within the text.

Maximum of all subarrays of size k

Given an array of integers and a number k, find the maximum for each and every contiguous subarray of size k.

Longest Subarray of sum K

Given an array containing N positive integers and an integer K, your task is to find the length of the longest Sub-Array with the sum of the elements equal to the given value K.

Longest Subarray with K Unique Characters

Given a string, find the length of the longest substring that contains at most K unique characters.

Longest Substring with No Repeating Characters

Given a string, find the length of the longest substring without repeating characters.

Given a string representing a long trail of toys, and an integer K=2, find the maximum number of toys you can pick up, given that you can only pick at most two types of toys.

Minimum Window Substring

Given two strings, s and t, find the minimum window in s which will contain all the characters in t in complexity O(n).