Do you think you can? (3 Part Series)
In today's article, let us look at an algorithm problem related to strings.
Given a main string S and a dictionary of smaller strings D
Can you find the largest string present in the dictionary that is a subsequence of the main string S?
Substring: A string a is said to be a sub-sequence of another string b if b contains all the strings present in the string a and also in the same order.
Do give it a try and compare your solution with the ones discussed in this video.
Hope that helped, Cheers!