Longest Non-Overlapping Repeating Substring - Amazon Coding Interview Question | Dynamic Programming

preview_player
Показать описание
Longest Non-Overlapping Repeating Substring - Amazon Coding Interview Question

Question:

Given a string,
find the length of the Non-Overlapping Repeating Substring.

Example:

The longest Non-Overlapping Repeating Substring for "aabaabaaba" is "aaba", whose length is 4.

#nonoverlapping #substring #repeating
Рекомендации по теме
Комментарии
Автор

Best explanation ever. Thank you so much..

ananttater
Автор

Amazing explanation. The best. The best!

zyro
Автор

Great explanation ma'am, if you can change the mic in which you are recording it would be of a huge help.
Thanks!!!

Zwieq
Автор

your explanation is amazing, i have subscribed your channel and liked your video🙂,
but in the overlapping case I have a doubt:
a a b a a b a a b a
L(3, 6) = 3 this will work right! (we are not considering overlapping)
so, L(3, 6) should be 3 not 0 right!!

jayendrareddy
Автор

Best explaintion !! Thank you ma'am.

koushiklakky
Автор

Thank you so much for the video.... you explained very well...

sonalpoddar
Автор

Why why I didn't found this channel till date 😭😭😭😭😭😭😭😭😭.

universal
Автор

Nice explanation, especially the overlap part.

swagatpatra
Автор

Nice explanation🤩 but i just wanted to know you come to know about the corner case

muskangupta
Автор

Is it possible to calculte it in O(n)?

jawadbinsarfraz
Автор

I think explaining brute force and then dp would be great.

krishnakeshav
Автор

Some questions like minimum node in tree

lifeoflearner
Автор

@21:12
LRS table, if it starts at 0 and ends at n, then LRS table is larger than the string input length by one, right? why so? In your previous analysis, the table is the same size as n*n.


@18:10, you said the value should not be greater than j-i, but in your code it is < j-i. Why is the equal condition neglected?

On first listen, I really enjoyed your analysis, but when I am ruminating through your code, there are just too many unexplained inconsistencies. I am disappointed.

ax
Автор

Mam apne galat smjaya hai or jo apne bad mai code dikhaya bo to bilkul hu alag hai apne l[n+1][n+1] kr rkha hai lekin app vedio mai to 7 index tak hi bta rhe ho plzz vha pr 8 bhi kro and code mai mam first make your concept clear then teach apki vajh se mera time krab hua itni der lag gyi samjne mai plzz be esa na kiya kro dang se smjhya kro beginners ko samja nhi ata fir

I_U_I_T_C
visit shbcf.ru