The video got cut off in the end, the binary search time complexity is O(logk*m*n) where k is the sum of the negative numbers
Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.