Sort the side lengths in descending order. The largest perimeter triangle will come from the first triplet that satisfies the triangle inequality.

Iterate through the sorted array and for each triple `(i, i+1, i+2)`, check if `nums[i] < nums[i+1] + nums[i+2]`. Return the sum of the first triple that passes — since you sorted descending, this gives the maximum perimeter.

If no triple passes the check, return 0. The greedy approach works because any non-consecutive triple with a smaller largest side would only yield an equal or smaller perimeter.