Virtusa Interview Question

Find longest common subsequence with memory optimization of 0(1)