package q976

import "slices"

func largestPerimeter(nums []int) int {
	slices.Sort(nums)

	for i := len(nums) - 1; i > 1; i-- {
		if nums[i-1]+nums[i-2] > nums[i] {
			return nums[i] + nums[i-1] + nums[i-2]
		}
	}
	return 0
}

var _ = largestPerimeter