Python exercise

Maximum weighted independent set in path graph

Sign in to hand in your solution and get feedback.

def WISPath(path: list): """ >>> WISPath([1, 4, 5, 4, 2, 8, 1, 5, 2, 3, 4, 3, 10, 2]) [1,3,5,7,10,12] """ #TODO