Go Perm Check
func permCheck(a []int) int {
sorted := append([]int(nil), a...)
sort.Ints(sorted)
for k, v := range sorted {
if k+1 < len(sorted) && v != k+1 {
return 0
}
}
return 1
}
This validates that every value from 1 to N appears exactly once.