40 docs tagged with "Sliding Window"

View all tags

2653. Sliding Subarray Beauty

This is a solution to the 2653. Sliding Subarray Beauty problem on LeetCode.

567. Permutation in String

This is a solution to the 567. Permutation in String problem on LeetCode.

Check If Array Pairs Are Divisible by k

This is a solution to the Check If Array Pairs Are Divisible by k problem on LeetCode.

Contains Dublicate -III

This is the solution of question H-Index II on leetcode

Contains Duplicate II(LeetCode)

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

Count Binary Substrings

This is a solution to the Count Binary Substrings problem on LeetCode.

Count Distinct Elements in Every Window

A solution to the problem of determining the count of distinct elements in every window of size k.

Count Subarrays with Product Less Than K

This is a solution to the problem of counting subarrays with product less than a given value K.

Count Substrings Starting and Ending with Given Character (LeetCode)

Return the total number of substrings of a string that start and end with a given character.

Defuse the Bomb Solution

This is a solution to the Defuse the Bomb problem on LeetCode.

Degree of an Array

This is a solution to the Degree of an Array problem on LeetCode.

Find Product Of Element Of Big Array (LeetCode)

this discription is for the solution of find-product-of-element-of-big-array

Find Subarray With Bitwise OR Closest to K (LeetCode)

This description is for the solution of Find Subarray With Bitwise OR Closest to K

Frequency of the Most Frequent Element

This is a solution to the Frequency of the Most Frequent Element problem on LeetCode.

Grumpy Bookstore Owner

This document provides solutions for the Grumpy Bookstore Owner problem on LeetCode.

Longest Continuous Subarray with Absolute Diff Less Than or Equal to Limit

This document provides solutions for the Longest Continuous Subarray with Absolute Diff Less Than or Equal to Limit problem.

Longest Substring Of All Vowels in Order

This is a solution to the Longest Substring Of All Vowels in Order problem on LeetCode.

Longest Substring Without Repeating Characters (LeetCode)

This is a solution to the Longest Substring Without Repeating Characters problem on LeetCode.

Max Consecutive Ones III

This document provides solutions for the Max Consecutive Ones III problem on LeetCode.

Maximize the Confusion of an Exam

This is a solution to the Maximize the Confusion of an Exam problem on LeetCode.

Maximum Points Inside the Square (LeetCode)

Given an array of points in the XY-plane, find the maximum number of points that can be inside a square with side length K.

Minimum Adjacent Swaps for K Consecutive Ones

This is a solution to the Minimum Adjacent Swaps for K Consecutive Ones problem on LeetCode.

Minimum Consecutive Cards to Pick Up

This is a solution to the 2260. Minimum Consecutive Cards to Pick Up problem on LeetCode.

Minimum Number of K Consecutive Bit Flips

This document provides a solution for the Minimum Number of K Consecutive Bit Flips problem.

Minimum Number of Operations to Make Array Continuous

This is a solution to the Minimum Number of Operations to Make Array Continuous problem on LeetCode.

Minimum Operations to Make Binary Array Elements Equal to One I

This is a solution to the Minimum Operations to Make Binary Array Elements Equal to One I in leetcode

Minimum Window Substring(LeetCode)

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".