can someone help me in this question that how can we solve this thanks in advance.↵
---------------------------------------------------------------------------------↵
Given 2 strings str1 and str2. What is the efficient way to navigate from str1 to str2? The constraints are i) a string can be changed to another string by changing only one character. ii) all the intermediate strings must be present in dictionary. If not possible, return “not possible to navigate from str1You are given with a string . Your task is to remove atmost two substrings of any length from the given string such that the remaining string contains vowels('a','e','i','o','u') only. Your aim is the maximise the length of the remaining string. Output the length of remaining string after removal of atmost two str2″. (pre-processing is allowed and enough memory is available). for example: str1 = feel and str2 = pelt, ↵
then the navigation is feel -> fell -> felt -> pelubstrings.↵
NOTE: The answer may be 0, i.e. removing the entire string.↵
↵
Sample Input↵
2↵
earthproblem↵
letsgosomewhere↵
↵
↵
Sample Output↵
3↵
2
---------------------------------------------------------------------------------↵
then the navigation is feel -> fell -> felt -> pel
NOTE: The answer may be 0, i.e. removing the entire string.↵
↵
Sample Input↵
2↵
earthproblem↵
letsgosomewhere↵
↵
↵
Sample Output↵
3↵
2
