charliegriefer

;; For a given list with N integers, return a new list removing the elements at odd positions.
;; Source: https://www.hackerrank.com/challenges/fp-filter-positions-in-a-list

;; My solution:
(fn[lst] 
    (map 
        #(when ((comp odd? first) %) 
            (println (second %)))
        (map-indexed list lst)))