Two Pointers: 3 Sum Zero

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤…

Two Pointers: Remove Duplicates from Sorted Array II

Given a sorted array, remove the duplicates in place such that each element can appear at most twice and return the new length.

Do not allocate extra space for another array, you must do this in place with…

Arrays : Min Steps In Infinite Grid

You are in an infinite 2D grid where you can move in any of the 8 directions. You are given a sequence of points and the order in which…

Two Pointers: 3 Sum

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target.
Return the sum of the three integers.

Assume that there will only be one solution