Print the shortest sub-string of a string containing all the given words.
In the first example, two solutions are possible: “world is here. this is a life full of ups” and “ups and downs. life is world”.
- Initialize HashMap with all the given words which are required to be searched and assign their values as -1.
- Maintain a counter.
- Traverse the entire String word by word and do following for each sentence word
- If the sentence word exists in the list of words you’re looking for, update the last position of that word.
- Increase the total count if the updated last position was not initialized.
- If the total count is equal to count of all given words, loop through the last positions and find the smallest one. The distance between the current position and that value will be the length of the substring. Record these values and find the best one over all positions
Below is Java implementation of above steps.
ups and downs. life is
This article is contributed by Shifa Khan. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.