Leetcode 300. Longest Increasing Subsequence

QUESTION:

SOLUTION:

def binarySearch(self, subsequence, val):
        left = 0
        right = len(subsequence)-1
        while left <= right:
            # do this to avoid overflow
            mid = left + (right - left)//2
            # if mid element of subsequence is less than val
            # set left to middle + 1
            if…