This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2016-01-11
Channels
- # admin-announcements (8)
- # announcements (1)
- # boot (343)
- # braid-chat (23)
- # cider (20)
- # clara (5)
- # cljsrn (48)
- # clojars (5)
- # clojure (90)
- # clojure-canada (3)
- # clojure-czech (1)
- # clojure-russia (107)
- # clojure-sg (2)
- # clojurebridge (2)
- # clojured (10)
- # clojurescript (70)
- # community-development (73)
- # cursive (106)
- # datavis (40)
- # datomic (40)
- # docs (4)
- # editors (1)
- # emacs (1)
- # events (4)
- # funcool (2)
- # hoplon (46)
- # jobs (2)
- # ldnclj (11)
- # mount (8)
- # om (214)
- # onyx (12)
- # re-frame (35)
- # reagent (31)
- # spacemacs (12)
- # yada (18)
Morning from train in Yorkshire. Sad news about David Bowie this morning 😢
måning yål
Hello, any suggestions on how to generate all the permutations of a given string. Eg. given "abcdedcba" I would like to return ["a" "ab" "abc" "abcde" "abcded" "abcdedc" "abcdedcba" "b" "bc" "bcd".... etc etc...
jr0cket: canned solution - https://github.com/clojure/math.combinatorics/blob/master/src/main/clojure/clojure/math/combinatorics.clj#L290
Thanks @mccraigmccraig the combinatorics does what its supposed to do, however I now have too many cobinations. I only want combos that exist within the original string. So i guess I can filter the output and drop any combos that are not sub strings of the original string.