Two pointers
Problems on two pointers, including finding two numbers with a given sum in a sorted array, the longest or shortest window with a given property, merging sorted sequences, counting pairs with a bounded difference and the shortest substring that contains every required letter.
The two pointers article in the Basics section explains the technique. Related problem sets are under Sorting, Binary search and Prefix sums.
Problems
Water#609
Very easy
Rotating Rings#1627
Medium
The sum is not without variety#1876
Very easy
Tartak#2368
Very hard
Public Order Committee#3127
Very easy
Label#3514
Hard
Graveyard Design#3862
Medium
Pilot Monitor#4205
Very hard
SumX#4256
Very easy
Photography#5236
Medium
A Huge Tower#5346
Medium
Contemporary Art#5990
Medium
Caper pizza#6916
Hard
Minimal Subarray Length#6951
Very easy
Zero quintuples#7448
Medium
Rotate List#7453
Very easy
Linked List Cycle#7454
Very easy
City Park#7917
Hard
Alarm Clock#8707
Easy