shreyansh

Strings and Sliding Window Problems

  1. 1456. Maximum Number of Vowels in a Substring of Given Length

    Given a string s and an integer k, return the maximum number of vowel letters in any substring of s with length k.

  2. 345. Reverse Vowels of a String

    Given a string s, reverse only all the vowels in the string and return it.

  3. 443. String Compression

    Poor description but it is what it is.

  4. Find All The Anagrams in a String

    Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in a

  5. Fruit Into Baskets

    You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by a

  6. Longest Repeating Character Replacement

    You are given a string s and an integer k. You can choose any character of the string and change it to any other upperca

  7. Longest Substring Without Repeating Window

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

  8. Maximum Number of occurrences of Substring

    Given a string s, return the maximum number of occurrences of anysubstring under the following rules:

  9. Minimum Window Maximum

    Given two strings s and t of lengths m and n respectively, return the minimum window

  10. Sliding Window Maximum

    You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the a

  11. Subarrays with K Different Integers

    import java.util.HashMap;

  12. Substrings of Size K with Distinct Characters

    A string is good if there are no repeated characters.