Leetcode 976. Largest Perimeter Triangle

Given an array of side lengths, pick three lengths that satisfy the triangle inequality (sum of any two sides > the third) to form a non-degenerate triangle and return the maximum possible perimeter; return 0 if no such triple exists.