Pareto Front Indices

Problem

The Pareto front of a set of objective vectors contains the points that are not dominated by any other point (minimization in every coordinate).

Given the list of points, return the sorted indices of the non-dominated points.

Hint

A point survives when no other point weakly beats it everywhere and strictly beats it somewhere.

case 1

in: [[[1,2],[2,3]]]

expected: [0]

case 2

in: [[[1,1],[1,2],[2,1],[3,3]]]

expected: [0]

case 3

in: [[[1,5],[5,1],[3,3]]]

expected: [0,1,2]

Starter codePython

def pareto_front_indices(points):
    # Your code here
    pass

3 test cases · run your code against them in the editor