{"push_id":2952815373,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"890ab0815dcc080252d49d473b7ec025fe0a9b18","before":"5424bd3e2c6c537da95302f0c16a0aa0837a3245","commits":[{"sha":"890ab0815dcc080252d49d473b7ec025fe0a9b18","author":{"name":"TaniaLaneva","email":"f3a6a5bcbbdee14d6223d2b2a7ea5f19be7a2cb1@users.noreply.github.com"},"message":"Create 34. Find First and Last Position of Element in Sorted Array C#\n\nGiven an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.\r\n\r\nYour algorithm's runtime complexity must be in the order of O(log n).\r\n\r\nIf the target is not found in the array, return [-1, -1].\r\n\r\nExample 1:\r\n\r\nInput: nums = [5,7,7,8,8,10], target = 8\r\nOutput: [3,4]\r\nExample 2:\r\n\r\nInput: nums = [5,7,7,8,8,10], target = 6\r\nOutput: [-1,-1]","distinct":true,"url":"https://api.github.com/repos/TaniaLaneva/LeetCode/commits/890ab0815dcc080252d49d473b7ec025fe0a9b18"}]}
{"actor":{"display_login":"TaniaLaneva"}}