You actually have a wrong LPS algorithm. Here's the right one:
function calculateLpsTable(subStr) { let i = 1; let j = 0; let lps = new Array(subStr.length).fill(0); while(i < subStr.length) { if(subStr[i] === subStr[j]) { lps[i] = j + 1; i += 1; j += 1; } else { if(j !== 0) { j = lps[j - 1]; } else { i += 1; } } } return lps; }
There was a small typo at line 8. Wrote "i" instead of "1".
Thanks for pointing.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
You actually have a wrong LPS algorithm. Here's the right one:
There was a small typo at line 8. Wrote "i" instead of "1".
Thanks for pointing.