Largest Palindrome Product
This is a somewhat common interview question that asks the following. Consider there is an array holding sorted numbers in an established range. For our example, we’ll propose numbers ranging from 1 to 100. No duplicate elements are allowed. Also, there is only one element missing. What is that element? Or to rephase it – how to find the missing number in a given integer array?