GREEDY MOVES DAY 02 – Q1

D2. Prefix-Suffix Palindrome (Hard version) Problem Statement - https://codeforces.com/problemset/problem/1326/D2 The problem was quite straight-forward application of KMP Algorithm. The first thing , we can easily check out for those characters…

Continue Reading GREEDY MOVES DAY 02 – Q1

Strings #1 Application of KMP

Shortest Palindrome Question : here So this problem requires us to find the shortest length of palindrome by appending characters in front of the string. Clearly, the fewer characters we…

Continue Reading Strings #1 Application of KMP

Longest Repeated Substring

Power of String (Question) : here We have to find the longest substring occurring in the string at least K times.The golden point is:  EVRY SUBSTRING IS A PREFIX OF…

Continue Reading Longest Repeated Substring

Longest Common Substring

The Story of String (Question) : here This is the first problem with suffix arrays. so I will give a little boring lecture on it. So, bare with me. Suffix Arrays…

Continue Reading Longest Common Substring