The Elegance of Clojure

elegance.clj

;; 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)))

;; A _much_ more elegant solution:
(fn [lst]
    (map second (partition 2 lst)))

Just had a shower thought. Literally, came to me as I was shampooing my beard.

(fn [lst] 
    (rest (take-nth 2 (conj coll 0))))  



user=> (rest (take-nth 2 (conj '(8 15 22 1 10 6 2 18 18 1) 0)))
;; => (15 1 6 18 1)

I'll break it down later.