From a list of integers, get the longest increasing subset. This would solve 4clojure problem 53 if 4clojure didn't use clojure 1.4. dedupe is from 1.7 on

longest_increasing_subset.clj

(fn [coll]
  (let [parduction-by (fn [predf coll] (->> (partition 2 1 coll) (partition-by predf) (filter #(some predf %)) (map #(mapcat identity %)) (map dedupe)))
        inc? (fn [[a b]] (= (inc a) b))]
    (->> (parduction-by inc? coll) (sort-by count) last)))


;; for an example of what parduction-by does, it's basically a combination of partition-by, reduce and filter
;; I'd like to take out the filter aspect and leave that for the user.
(parduction-by inc? '(1 0 1 2 3 0 4 5)) ;; => '((0 1 2 3) (4 5))