Two pointers

Implement a ‘two pointers’ algorithm, where one pointer moves at a fast pace, advancing two steps at a time, and the other moves at a slower pace, advancing one step at a time. When the fast pointer reaches the end, return the position of the slow pointer.

This problem also employs the “Two Pointers” technique, which is rather ingenious.

This is an easy one, just use the two pointers.

Greedy + Two Pointers

Same as 3sum, for big number, using BigInteger .

Same as 3Sum

Sort the array, then use 2 pointers to get the exceeded result.

Description: https://leetcode.com/problems/container-with-most-water/ Notes: Using two pointers