Topic 13 of 21
Sliding Window & Two Pointer Problems
Longest substring without repeating characters, fruit into baskets, nice subarrays, minimum window substring and more.
12 sliding window & two pointer problems (1 easy, 8 medium, 3 hard) with LeetCode and GeeksforGeeks links.
Your progress
– / 12 solved
- Easy
- –/1
- Medium
- –/8
- Hard
- –/3
/
- Longest Substring Without Repeating CharactersMediumLeetCodeGFG
- Max Consecutive Ones IIIMediumLeetCodeGFG
- Fruit into BasketsMediumLeetCode
- Longest Repeating Character ReplacementMediumLeetCodeGFG
- Binary Subarray with SumEasyLeetCodeGFG
- Count Number of Nice SubarraysMediumLeetCodeGFG
- Number of Substring Containing All Three CharactersMediumLeetCode
- Maximum Points You Can Obtain from CardsMediumLeetCodeGFG
- Longest Substring with at Most K Distinct CharactersMediumLeetCodeGFG
- Subarray with K Different IntegersHardLeetCodeGFG
- Minimum Window SubstringHardLeetCodeGFG
- Minimum Window SubsequenceHardLeetCodeGFG