Find longest increasing subsequence in a sequence of random numbers

interview.clj

(ns interview.core)

(defn gen-seq
  "Generates a random seq of numbers"
  [n]
  (for [_ (range n)]
    (inc (rand-int 10))))

(defn find-longest-seq
  "Find longest increasing subsequence"
  [s]
  (let [lengths (reverse (range 1 (count s)))
        subseqs (map #(find-seq s %) lengths)]
    (first (remove nil? subseqs))))

(defn find-seq
  "Find increasing subsequence of length n"
  [s n]
  (first (filter #(apply > (reverse %)) (partition n 1 s))))

(find-longest-seq [1 2 3 6 8 1 2 4 1 2 3 5 6 7 8])
; (1 2 3 5 6 7 8)