Find the largest substring in which the number of integer elements is equal to number of non integer elements.

matching-substring-integer-counts.clj

(defn find-subcoll-of-equal-int-nonint [coll]
  (let [candidates (->> (range 2 (count coll) 2)
                        reverse
                        (map #(-> (partition % 1 coll)
                                  (doto println)))
                        (reduce concat)
                        (filter (fn [candidate]
                                  (let [{ints true
                                         non-ints false} (group-by integer?
                                                                   candidate)]
                                    (= (count ints)
                                       (count non-ints))))))]
    (first candidates)))