Sequential String

A special string s of length n consists of characters $0-9$ only. Its characters can only be accessed sequentially i$.$e the first $1\text{'}$ chosen is the

leftmost $\text{'}1\text{'}$ in s$.$ There is an array arr of m strings, also consisting of characters $0-9.$ Calculate the minimum number of characters

needed from sto construct a permutation of each of the strings in arr

Return an array of integers where the th element denotes the minimum length of a substring that contains a permutation of the ith

string in arr. If a string cannot be constructed, return $-1$ at that index

Example

Consider n$=12,$s$="064819848398",$ m$=3,$ arr$=["088","364","07"]$

To construct $"088".$ Alice needs to access the first $7$ characters $(")64819848398")$ of the special string and use only $\text{'}",8\text{'},$ and $8\text{'}.$ Since the

characters can be rearranged, the results for $088\text{'},\text{'}808\text{'},$ and $880`$ are all $7.$

To construct $"364".$ access the first $10$ characters $("064819848398")$ of the special string and use only $"6".\text{'}4,$ and $3".$ Rearrange to match $"364".$

String $"07"$ cannot be constructed from the special string. No $7"$ is available.

The return array is $[7,10,-1],$ Note that only bolded characters are used to construct the strings.

Function Description

Complete the function countMinimumCharacters in the editor below.

countMinimumCharacters has the following parameters:

string s: the special string of length n

string arrlm$]$: strings to construct

Returns

int$[]$: the fth element corresponds to the minimum number of characters required to construct the ith string, or $-1$ if the string cannot

be constructed

write solution in java