4clojure #53 - Longest continuous increasing subsequence

gistfile1.clj

;; hyone's solution to Longest Increasing Sub-Seq
;; https://4clojure.com/problem/53

(fn longest-inc-seq [coll]
  (reduce #(let [len-a (count %1)
                 len-b (count %2)]
             (if (and (> len-b 1) (> len-b len-a)) %2 %1))
    []
    (reductions
      (fn [xs y]
        (if (> y (last xs)) (conj xs y) [y]))
      [(first coll)]
      (rest coll))))

Cool! Here is mine.

(fn [coll] 
  (let [a (partition-by #(< (first %) (last %)) (partition 2 1 coll))
        b (filter #(< (ffirst %) (second (first %))) a)
        c (reduce #(if (< (count %1) (count %2)) %2 %1) [] b)] 
   (concat (first c) (map last (rest c)))))

(fn [coll] 
  (let [a (partition-by #(apply < %) (partition 2 1 coll))
        b (filter (fn [[[x1 x2]]] (< x1 x2)) a)
        c (first (sort-by count > b))] 
   (concat (first c) (map last (rest c)))))

lonest of mine . :

(fn [coll]  
	(let [group-coll-index (fn [coll] (partition-by #(take-last 1 %) 
			(partition 2 
				(interleave coll 
					(flatten 
						(partition-by identity 
							(map + coll (iterate dec 0))) 
						))))) 
		  ] 
		  (if (>= (apply max (map count (group-coll-index coll))) 2) 
		  	(flatten (map butlast (last (sort-by count (group-coll-index coll)))))
		  	[])
		  )	
    )