Package g2401_2500.s2486_append_characters_to_string_to_make_subsequence

Class Solution

java.lang.Object
g2401_2500.s2486_append_characters_to_string_to_make_subsequence.Solution
public class Solution extends java.lang.Object
2486 - Append Characters to String to Make Subsequence.

Medium

You are given two strings s and t consisting of only lowercase English letters.

Return the minimum number of characters that need to be appended to the end of s so that t becomes a subsequence of s.

A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

Example 1:

Input: s = “coaching”, t = “coding”

Output: 4

Explanation: Append the characters “ding” to the end of s so that s = “coachingding”. Now, t is a subsequence of s (“ co aching ding ”). It can be shown that appending any 3 characters to the end of s will never make t a subsequence.

Example 2:

Input: s = “abcde”, t = “a”

Output: 0

Explanation: t is already a subsequence of s (“ a bcde”).

Example 3:

Input: s = “z”, t = “abcde”

Output: 5

Explanation: Append the characters “abcde” to the end of s so that s = “zabcde”. Now, t is a subsequence of s (“z abcde ”). It can be shown that appending any 4 characters to the end of s will never make t a subsequence.

Constraints:

  • 1 <= s.length, t.length <= 105
  • s and t consist only of lowercase English letters.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    appendCharacters(java.lang.String s, java.lang.String t)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • appendCharacters

      public int appendCharacters(java.lang.String s, java.lang.String t)