Minimum Time to Revert Word to Initial State | Part I | Part II | KMP | Leetcode 3029 | 3031

[@anshulsharma3137]

this is more easier to solve with Z function because you can check at every interval of k, if the value in z array is equal to length of suffix then we can simply stop there. please make one video on Z function as well

[@DevOpskagyaan]

Superb explanation

[@anshulsharma3137]

I can see a new striver in the making ❤

[@bhuppidhamii]

It's mik in the making

[@aws_handles]

Legend in the making 🔥

[@anushkathakur6531]

I would say better than striver

[@souravjoshi2293]

It's Legend MIK in the making

[@gui-codes]

It's a new LEGEND in the making.

[@thekindspill]

Thanks a lot. was waiting for your explanation for this video.

[@AyushDahiya-et6cc]

BDIYAA

[@nileshdeshmukh7841]

Thankyou so much for this video!

[@its_me_hb]

Awesome Man

[@harsh2518]

bhai please videos me timestamps lga diya kro thoda helpful hota hai baki explanation is very good.

[@codestorywithMIK]

Sure ❤️

[@AshuAnu-ec9ko]

sir try to upload videos of rabin karp and z algorithm

[@tutuimam3381]

Thanks a lot

[@theOmKumar]

I could only come up with (n- lps)/k and submitted wrong answer😅, thank you for the detailed explanation.

[@codestorywithMIK]

Trust me, you came up with (n-lps)/k That’s commendable 👌👌

[@theOmKumar]

@@codestorywithMIK thank you bhaiya 🙏 learning from you!

[@DevOpskagyaan]

I could only solve 1st qn in the contest 😢 But I will try my best

[@23cash86]

Thankssd

[@Strawcontamination]

please make a video on how to use comparator and lambda in c++ and also in java

[@HimanshuVarshney-z7e]

bhaiya aaj ke leetcode ke contest ka 4th question ka bhi video bna do na ....aapki wajaah se meri leetcode ki rating 1812 ho gyi hi and bdh bhi rhi hai ...thanks a lot bhaiya ...

[@navdeepdhama403]

I am not able to understand why he use substring from i to n-1 it should be from i to n-1 as we have not appended the k length to original string end

[@ektuhaso]

Thank you so much sir ❤️ Leetcode 3025 3026 and leetcode 3027 please sir i request you

[@Ramneet04]

Bhaiya biweekly too please 🙏 2nd and 4th

[@rdxrdx1792]

Ipad notes of this video

[@prakhargarg4166]

Please add timestamps

[@codestorywithMIK]

Sure ❤️

[@anushkathakur6531]

Bhaiya, len=LPS[len-1]; is getting accepted but here len-- is giving wrong answer....but why?

[@devanshverma8050]

vector computeLPS(string &pat) { /*lps computation */ } int minimumTimeToInitialState(string word, int k) { vector lps=computeLPS(word); int suffLen=lps.back(); int n=word.size(); while(suffLen && (n-suffLen)%k) suffLen=lps[suffLen-1]; if((n-suffLen)%k==0) return (n-suffLen)/k; return ceil(n/(double)k); } if we tried to do suffLen-- instead of suffLen=lps[suffLen-1]. If we did suffLen-- directly then we might not reach the end of the prefix by which our suffix was matching, then there might be the case that by decrementing the suffLen by 1 (n-suffLen)%k==0 hence breaking the loop. so there won't be any successful comparison. for better understanding u can the dry run of the test case: word="baba" k=3

[@dayashankarlakhotia4943]

public int minimumTimeToInitialState(String word,int k){ int n=word.length,j=0,len[]=new int[n]; for(int i=1;i0){ j=len[j-1]; } return (n-j+k-1)/k; } }