Комментарии:
Music is really bad
ОтветитьContent is good. Pls add the audio in this vedio
ОтветитьProvide Solution Of HackerEarth Coding Questions For Assessments In Java If You Read This Comment Then Ping Me On My Email ID By Today.
ОтветитьYou should also add voice explainiation, that would make it easier to understand.
ОтветитьGeeksforgeeks amazing content as always. We just want some edge cases examples where you iterated over the whole algorithm with each step put down in proper.
ОтветитьVoice not there but till very good video.
Ответитьcan we print -1 if there's no match?
ОтветитьThe Video does not cover the conditional branch when Len is not 0 and the string at I and at Len does not match. This is the part I do not understand.
ОтветитьLog2base2 is one of the worst thing don't take part into it anyone. My money was waste for that
ОтветитьWell explained gfg.. Keep it up
ОтветитьVoice over by someone would have been better...
ОтветитьThe best video, I have found so far.
The animation of sliding the pattern against txt string gave a new perspective to understand it.
Thankyou very much!
A very detail explanation. It is hard to understand by just reading text
ОтветитьThank you so much for your hard work!
ОтветитьThis algorithm doesn't look like the same which is described on the corresponding wikipedia article, which is more efficient. This is not KMP, it's some variation.
ОтветитьYet the example is simple but is the best for understanding the algorithm.
ОтветитьInstead of background music if there was a voice explaining it we would have understood it better.
ОтветитьVery clear. I wish you could create a clip for BM algorithm like this.
ОтветитьGood explanation but as other people mentioned, more examples would be helpful as well as edge cases
ОтветитьI am just amazed with the algorithm K-M created.
Ответить