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 [partition-even (if (even? (count coll)) (count coll) (dec (count coll)))
        coll-sizes (range partition-even 0 -2)
        candidates (reduce concat (map #(partition % 1 coll) coll-sizes))
        candidates-group (map (juxt identity (partial group-by integer?)) candidates)
        match (some
               (fn [[candidate count-map]]
                 (and (= (count (count-map false)) (count (count-map true))) candidate)) candidates-group)]
    match))