Longest Increasing Sub-Seq – Rich 4Clojure Problem 53 – See: https://github.com/PEZ/rich4clojure

rich4clojure_hard_problem_053.clj

(ns rich4clojure.hard.problem-053
  (:require [hyperfiddle.rcf :refer [tests]]))

;; = Longest Increasing Sub-Seq =
;; By 4Clojure user: dbyrne
;; Difficulty: Hard
;; Tags: [seqs]
;; 
;; Given a vector of integers, find the longest
;; consecutive sub-sequence of increasing numbers. If two
;; sub-sequences have the same length, use the one that
;; occurs first. An increasing sub-sequence must have a
;; length of 2 or greater to qualify.

(def __ :tests-will-fail)

(comment
  
  )

(tests
  (__ [1 0 1 2 3 0 4 5]) := [0 1 2 3]
  (__ [5 6 1 3 2 7]) := [5 6]
  (__ [2 3 3 4 5]) := [3 4 5]
  (__ [7 6 5 4]) := [])

;; To participate, fork:
;; https://github.com/PEZ/rich4clojure

;; Post your solution below, please!