Crossposted to stackoverflow. In a Clojure program, I have a sequence of numbers:
(2 3 4 6 8 1) I want to find the longest sub-sequence where the items are sequential: (2 3 4) I am assuming that it will involve (take-while ...) or (reduce ...). Any ideas? -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
