← Roadmaps all two pointers & window problems

👉

Two Pointers & Window

Opposite ends, fast/slow, fixed & variable windows.

4 subtopics · 26 problems0/26 on the path solved

next ▸ Valid palindromemachine 1120

01

Opposite ends

0/7

Palindrome, two sum sorted, water, 3-sum.

○Valid palindromeSilver · 1120 ○Two sum (sorted)Silver · 1150 ○Reverse vowels of a stringGold · 1300 ○Two Sum II — Sorted InputGold · 1350 ○Container with most waterGold · 1380 ○Three sum (count triplets)Gold · 1540 ○Trapping rain waterPlatinum · 1820

02

In-place pointers

0/3

Remove duplicates, move, squares, colors.

○Squares of a sorted arrayGold · 1340 ○Minimum Window SubsequenceGold · 1550 ○Constrained Subsequence SumDiamond · 1900

03

Fixed window

0/3

Size-k sum, average, vowels, anagrams.

○Maximum Sum Subarray of Size KSilver · 1050 ○Max sum of window size kSilver · 1080 ○Permutation in StringGold · 1400

04

Variable window

0/13

Longest unique, min window, k distinct.

○Max consecutive onesSilver · 1050 ○Longest Substring Without Repeating CharactersSilver · 1150 ○Longest Subarray With Sum At Most KGold · 1300 ○Smallest Subarray With Sum At Least TargetGold · 1300 ○Max Consecutive Ones With K FlipsGold · 1350 ○Fruit Into BasketsGold · 1400 ○Longest Substring With At Most K DistinctGold · 1400 ○Longest Repeating Character ReplacementGold · 1450 ○Substrings Containing All Three CharactersGold · 1500 ○Continuous SubarraysGold · 1550 ○Subarrays With K Distinct IntegersPlatinum · 1750 ○Minimum Window SubstringPlatinum · 1850 ○Shortest Subarray With Sum At Least KPlatinum · 1850