https://www.hackerrank.com/challenges/tutzki-and-lcs/problem
I ve been trying to solve this for hours and could'nt find any understandable online solution, Can anyone explain the logic and code behind this problem.
# | User | Rating |
---|---|---|
1 | Benq | 3783 |
2 | jiangly | 3666 |
3 | tourist | 3611 |
4 | Um_nik | 3536 |
5 | inaFSTream | 3477 |
6 | fantasy | 3468 |
7 | maroonrk | 3464 |
8 | QAQAutoMaton | 3428 |
9 | ecnerwala | 3427 |
10 | Ormlis | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 184 |
2 | adamant | 178 |
3 | awoo | 177 |
4 | nor | 169 |
5 | maroonrk | 165 |
6 | -is-this-fft- | 163 |
7 | antontrygubO_o | 152 |
7 | ko_osaga | 152 |
9 | dario2994 | 150 |
10 | SecondThread | 149 |
https://www.hackerrank.com/challenges/tutzki-and-lcs/problem
I ve been trying to solve this for hours and could'nt find any understandable online solution, Can anyone explain the logic and code behind this problem.
Name |
---|
You just calculate the $$$LCS$$$ as you do.
Let $$$dp1[i][j]$$$ denotes the $$$LCS$$$ of the suffix starting from $$$ith$$$ and $$$jth$$$ index of string $$$a$$$ and $$$b$$$ respectively.
And $$$dp2[i][j]$$$denotes the $$$LCS$$$ of the prefix till $$$ith$$$ and $$$jth$$$ index of string $$$a$$$ and $$$b$$$ respectively.
Now assume we are adding a character before $$$ith$$$ index of string $$$a$$$ to match it with $$$jth$$$ index of string $$$b$$$. Think of the condition for this pair of indexes to contribute to the answer.
$$$dp1[i][j+1] + dp2[i-1][j-1] == LCS$$$
If we implement that condition directly, then it will overcount. Think why is it so?
Only the different number of final $$$a$$$ string formed matters. So, there might be a possibility that you are counting the same character at an index multiple times because that character may appear at different positions in string $$$b$$$.
You can create a $$$vis[i][j]$$$ array to mark $$$1$$$ if you have placed $$$jth$$$ character at index $$$i$$$, and then count the final answer using the number of elements that are marked $$$1$$$ in the $$$vis$$$ array.
Thank you so much brother. I understood your explanation.