Given a string s and a boundary k, you really wanted to check if there exist k+1 non-void strings a1,a2...,ak+1, to such an extent that s=a1+a2+… +ak+ak+1+R(ak)+R(ak−1)+… +R(a1). Here + addresses connection. We characterize R(x) as a
Correct answer will be upvoted else downvoted. Computer science.
Given a string s and a boundary k, you really wanted to check if there exist k+1 non-void strings a1,a2...,ak+1, to such an extent that
s=a1+a2+… +ak+ak+1+R(ak)+R(ak−1)+… +R(a1).
Here + addresses connection. We characterize R(x) as a turned around string x. For instance R(abcd)=dcba. Note that in the recipe over the part R(ak+1) is deliberately skipped.
Input
The input comprises of various experiments. The primary line contains a solitary integer t (1≤t≤100) — the number of experiments. The portrayal of the experiments follows.
The principal line of each experiment portrayal contains two integers n, k (1≤n≤100, 0≤k≤⌊n2⌋) — the length of the string s and the boundary k.
The second line of each experiment portrayal contains a solitary string s of length n, comprising of lowercase English letters.
Output
For each experiment, print "YES" (without quotes), in case it is feasible to find a1,a2,… ,ak+1, and "NO" (without quotes) in any case.
You can print letters regardless (upper or lower).
Step by step
Solved in 3 steps with 1 images
