Sunday, July 5, 2009

Generate all the substrings of len k, of a given string s

An interview question: generate all the substrings of len k, for a given string s. In optimal time and space.
Pubblicato da a

1 comment:

  1. codingplaygroundJuly 13, 2009 at 7:17 AM

    I like this question, since it shows how to count on a bitset vector.

    http://www.di.unipi.it/~gulli/coding/permutation.tgz

    ReplyDelete

Subscribe to: Post Comments (Atom)