Binary search

nums is sorted in ascending order. Return the index of target, or -1 if it is not present. Aim for O(log n).

function solve(nums, target)

nums = [1,3,5,7,9]
target = 7
→ 3

Submit also runs 4 hidden tests, including edge cases.