Find the Longest Increasing Subsequence from an array

lis.py

def populate_incr_subseq_list(arr: list) -> list:
    len_of_inp = len(arr)
    temp_list = [1] * len_of_inp
    for i in range(1, len_of_inp):
        for j in range(0, i):
            if arr[j] < arr[i]:
                temp_list[i] = max(temp_list[1], temp_list[j] + 1)
    return temp_list


def find_max_from_list(arr: list) -> int:
    lis = 1
    for i in arr:
        lis = max(lis, i)
    return lis


def test_lis():
    arr = [3, 4, -1, 0, 6, 2, 3]
    assert find_max_from_list(arr=populate_incr_subseq_list(arr=arr)) == 4
    assert find_max_from_list(arr=populate_incr_subseq_list(arr=[])) == 1