Python exercise

Longest increasing subsequence

Sign in to hand in your solution and get feedback.

def find_optimum(row:list):