Sufix array to solve longest common subsequence ?

I have recently learned that suffix arrays along with LCP array carries huge chunk of information with them and i have seen also seen huge applications of that too but i am wondering whether we can solve longest common subsequence problem (https://en.wikipedia.org/wiki/Longest_common_subsequence_problem) by them?
Also, please suggest me some problems for suffix arrays and lcp in easy to hard order?

Problems

  1. SEAINCR (From DEC16) (Medium)

  2. TANDEM(Practice)(MEDIUM)

CodeChef has one very useful feature, you can search problems with tags, you can see this option on homepage.

Here are problems with tag lcs

And problems with tag lcp

//