Applies when with Arrays or Linked Lists you are asked to find or calculate something among all the subarrays or sublists of a given size.
Sorted easiest to hardest
Subarray
[x] Maximum Sum subarray of size K
[ ] Smallest subarray with a greater sum
[ ] Fruits into basket
[ ] Longest subarray with ones after replacement
Substring
[ ] Longest substring with maximum K distinct characters
[ ] Longest substring with distinct characters
[ ] Longest substring with same letters after replacement
Problem Challenge
[ ] Given a string and a pattern, find out if the string contains any permutation of the pattern.
[ ] Given a string and a pattern, find all anagrams of the pattern in the given string.
[ ] Given a string and a pattern, find the smallest substring in the given string which has all the character occurrences of the given pattern.
[ ] Given a string and a list of words, find all the starting indices of substrings in the given string that are a concatenation of all the given words exactly once without any overlapping of words. It is given that all words are of the same lengt
Sliding Window Pattern
Applies when with Arrays or Linked Lists you are asked to find or calculate something among all the subarrays or sublists of a given size.
Sorted easiest to hardest
Subarray
Substring
Problem Challenge
[ ] Given a string and a pattern, find out if the string contains any permutation of the pattern.
[ ] Given a string and a pattern, find all anagrams of the pattern in the given string.
[ ] Given a string and a pattern, find the smallest substring in the given string which has all the character occurrences of the given pattern.
[ ] Given a string and a list of words, find all the starting indices of substrings in the given string that are a concatenation of all the given words exactly once without any overlapping of words. It is given that all words are of the same lengt