How to make this algorithm dinamic or rewrite it better?

Question

I am working on the Algorithm longest-common-subsequence-of-n-strings. So far i have this code

`   public  String identifyCommonSubStrOfNStr(String[] strArr) {