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.
Subscribe to:
Post Comments (Atom)
Random commentary about Machine Learning, BigData, Spark, Deep Learning, C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
1 comment:
I like this question, since it shows how to count on a bitset vector.
Reply Deletehttp://www.di.unipi.it/~gulli/coding/permutation.tgz