#Program NamePatternTimeSpaceKey IdeaLevel
1validPalindromeTwo PointerO(n)O(1)Move left and right pointers inward, skipping non-alphanumerics.Simple
2threeSumSort + Two PointerO(n²)O(1)Sort array, then fix one element and use two-pointer on the rest.Middle
3containerWithMostWaterTwo PointerO(n)O(1)Always move the shorter side inward to find a potentially taller boundary.Middle