when character are not match we have to move towards maximum index what if both the index has same value??
Printing longest common subsequence
It doesn’t matter then, you can move to either side.
This case would arrive if there are multiple LCS.
how we get intution that we can solve this problem like this?? its by observation or some understanding??
Its just practise. dont put too much stress on the intuition part, just keep on practising.
brainstorm for an hour or so, and then look at the soln, try to understand it, implement it yourself, and then move to next problem.
after a month or so you can revisit that question.
Ohk thanks sir… …
1 Like
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.