Exactly three adjacent 3 in lists: Difference between revisions
m
→{{header|Haskell}}
Line 76:
Or (same test and results):
<lang haskell>import Data.
import Data.List (elemIndex)
nnPeers :: Int -> [Int] -> Bool
Line 83 ⟶ 84:
p = (n ==)
go i =
bimap
in all p a && not (any p b)</lang>▼
(all p)
(not . any p)
=={{header|Julia}}==
| |||