[LeetCode] Top Interview 150 Problems Solving # 35 Search Insert Position

Understanding the Problem This should be a typical binary search algorithm problem. This problem is meticulous about the time efficiency as this has to be solved with the time complex of O(log n). There is a number target as an integer. It is to find...