If I fix the 1st string and iterate for the 2nd string from 1 to < n and then I take the minimum size of LCS of all the iterations. Will this approach work?
It will not work.
A counter example for your approach:
3 ABC A B
Also the following says the problem of finding LCS of N Strings is NP Hard.
what if it’s given that the size of all strings is same, in that case can I use that approach? Which I mentioned before.
Counter Example for modified Constraints:
3 ABC BBB CCC
Thanks, your test cases made my doubts clear