Maximum String Combinations

Problem Statement

Maximum String Combinations Problem Description There are N dishes on the table in a party named with different alphabets given by a string S. Your friend has bought a combination of dishes denoted by string D on his plate, and you want the same combination of dishes. You can remove some dishes from the table. You remove X dishes from the table and the new set of dishes left on the table is string Q. Find the maximum number of non-overlapping combinations of dishes same as string D that can be found in string Q, for all values of X from 0 to N. Note You can choose only dishes that are kept consecutively to each other. Example of a non-overlapping combination: If string S = 'xyzyz', non-overlapping combination: 'xyz'. Function Description In the provided code snippet, implement the provided maxstring(...) method to find the maximum number of non-overlapping combinations of dishes same as string D that can be found in string Q, for all values of X from 0 to N. You can write your code in