Leetcode 2565 || subsequence with the minimum score ||
You are given two strings s and t.
You are allowed to remove any number of characters from the string t.
The score string is 0 if no characters are removed from the string t, otherwise:
Let left be the minimum index among all removed characters.
Let right be the maximum index among all removed characters.
Then the score of the string is right - left + 1.
Return the minimum possible score to make t a subsequence of s.
A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not).
On this page of the site you can watch the video online Leetcode 2565 || subsequence with the minimum score || with a duration of hours minute second in good quality, which was uploaded by the user Code With U-DAY 14 February 2023, share the link with friends and acquaintances, this video has already been watched 338 times on youtube and it was liked by 7 viewers. Enjoy your viewing!
