Problem Statement

Game On String Problem Description You are given two strings S and T. Determine the fewest number of characters in S that must be changed so that T appears somewhere inside S as a contiguous substring. Input Format The first line contains a string S. The next line contains a string T. Output Format Print the minimum number of characters in S that need to be changed. Examples Example 1: Input: codeforces leetcode Output: 6 Explanation: At least 6 positions in S must differ from T no matter where T is aligned inside S, so 6 changes are unavoidable. Overwriting S with cleetcode, for instance, embeds leetcode as a substring using exactly that many edits. Constraints 1 The length of T is at most that of S S and T consist of lowercase English letters.