## Saghar H

I am a PhD student at University of Washington in Seattle. My research is focused on developing distributed optimization algorithms and machine learning methods. I have applied these algorithms on classification problems in large scale data sets, control of autonomous multi-agent systems, i.e., unmanned aerial vehicles, energy management in smart grids, and studying social networks.

I decided to use the dynamic programming approach for this problem where we look for the shortest sub-string in S[i:] that contains element in a A where A is a sub-string of T. Also, we keep track of its initial index.

Note that this approach is O(N) given that the number of possible sub-strings of T is constant and small compare to N.

Complexity: O(N)

Program in Python:

- Saghar H November 05, 2015