sml/nj enumerating solutions
Posted
by john
on Stack Overflow
See other posts from Stack Overflow
or by john
Published on 2010-04-25T12:37:39Z
Indexed on
2010/04/25
12:43 UTC
Read the original article
Hit count: 385
i need help enumerating all possible combinations of length n given a list of strings.
example, if my list was ["r","b","g"] and int 2 answer:
r r, r b, r g, b r, b b, b g, g r, g b, g g,
© Stack Overflow or respective owner