I was thinking about a problem and I don't know if it is already available. I googled about it and could not find anything satisfactory, so, posting it here. Can you help me to devise a solution.
Problem goes like this:
We are given with a string S and an array of string A.
For a given integer K, we define an array of string B, where B consist of all the string Ai from A, such that Ai can be formed from S with maximum K updates.
Given an integer M (1<=M<=5), how to find array B for each integer K where 1<=K<=M.
Suggest optimal way to solve this.