1: Given an array with duplicate numbers, return filtered array 2: Given an array of N elements containing 1 to N numbers, return a missing number 3: check if a word is a palindrome
Sigiloso
Pointer technique. All you need is either 1 or 2 pointers to achive O(n) run time and O(1) space