easy - accepted / - tried
This is a variation of 37. implement Binary Search (unique).
Your are given a sorted ascending array of number, but might have duplicates, you are asked to return the element right before first appearance of a target number.
If not found return
Please don't use
Array.prototype.indexOf(), it is not our goal.
Let's try to solve this problem within 10 minutes.