Source :
Code :
Applications :
1. Find all sub-stings from a given set in a text & how many times they occurs in the text. (Implemented above)
2. Find the lexicographical smallest string of a given length that does not match any given strings.
3. Find the shortest string contain all given strings.
4. Find lexicographical smallest string of length L containing K strings.
No comments:
Post a Comment