Minimum Deletions for Exact Pattern Count

Problem Statement

Minimum Deletions for Exact Pattern Count Problem Description You have two strings A and B. You need to delete some letters from string A so that string A contains exactly K copies of string B as substrings. Find the smallest number of letters you need to delete from string A to meet this requirement. Note: Both strings A and B have only small English letters from a to z. Complete the solve function given in the editor. This function takes the following 3 parameters and returns the result. Parameters: K: Represents the target count A: Represents the main string B: Represents the pattern string Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code. The first line contains T, which represents the number of test cases. For each test case: The first line contains K showing the exact number of pattern matches needed. The second line contains string A. The third line contains s