Split a string into all possible combinations (Regex and Linq?)

• • Reply

  10 years ago

  by badulescub

  Bogdan Badulescu

  Montreal, Canada

  Joined 10 years ago

  Hello,

  Here is the challenge:

  Is there a way to split a string of minimum 4 : "abcd" and maximum 12: "abcdefghijklmnop" into all possible consecutive 4 combinations of maximum 3 elements?

  a.b.c.d - only 1 possibility for this one but for "abcdefgh": - a.bc.de.fgh - abc.d.e.fgh .... all possibilities

  Using REGEX and LINQ ?

  Thank you.

  Report abuse
• • Reply

  10 years ago

  by badulescub

  Bogdan Badulescu

  Montreal, Canada

  Joined 10 years ago

      public static IEnumerable<IEnumerable<T>> Permute<T>(IEnumerable<T> list)
      {
          if (list.Count() == 1)
              return new List<IEnumerable<T>> { list };
  
          return list.Select((a, i1) => Permute(list.Where((b, i2) => i2 != i1)).Select(b => (new List<T> { a }).Union(b)))
                     .SelectMany(c => c);
      }
  

  Report abuse