Length of longest substring to be deleted to make a string equal to another string
Given two strings str1 and str2, where str2 is a subsequence of str1, the task is to find the length of the longest substring of str1 which when removed, makes the strings str2 and str1 equal. Examples: Input: str1 = âprogrammingbloodsâ, str2 = âibloodsâ Output: 8 Explanation: Substrings to be remov