Coding interview problem from JP Morgan

Question

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 .