0

Given as input a list of positive integers, your task is to determine if every integer present has exactly two neighbors in the list. The neighbors of a integer \$x\$ are the distinct characters that appear next to an \$x\$ anywhere in the list. For example in the list:
[1,3,4,4,3,2,1]
The numb...