0 like 0 dislike
954 views
Given a string of length n , find the smallest substring of a string where each character from 'a' to 'z' , appears atleast once . Try to do it in  better than O(N*N) polynomial solution .
in Algorithms and Problems by Expert (91,670 points) | 954 views

Please log in or register to answer this question.