I agree that the code for your approach is far simpler.

But, Longest Common Subsequence is not too difficult either. It is just a small DP, which can be implemented easily and handles all edge cases that I can think of now.

Also, the longest common subsequence might be of use in future. 

Right, let's ask Michael to review.