Problem Statement

Game On String Problem Description Given two strings S and T check how many minimum characters in S we should change such that T occurs as a substring in S. 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: We have to change a minimum of 6 characters in string S to obtain T as a substring of the given string. One possible solution is to modify string S as cleetcode. We can see it contains leetcode as a substring. Constraints 1 <= |S|,|T| <= 1000 The length of T is at most that of S S and T consist of lowercase English letters.