Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity.

Example: Input: nums = [5,7,7,8,8,10], target = 8 Output: [3,4]

If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity.

Example: Input: nums = [5,7,7,8,8,10], target = 8 Output: [3,4]

Public