5. Longest Palindromic Substring | Day 001 | Brute - Better - Optimal | 2 Pointers | DP

[@amanverma-sc8my]

space is used in expanding method because string odd ,string even take o(n) space complexity

[@venkadeshb7973]

Yeah, we can optimize it by storing the left and right indices.

[@hishamakmal2149]

Thanks for the approaches! But i dont think we need memoization in 2nd approach, if we use the following : for (int i = 0; i < n; i++) { for (int j = i; j < n; j++) { if (j - i + 1 > maxLen && solve(s, i, j)) { maxLen = j - i + 1; start = i; } } }

[@arpitgoyal2035]

Amazing bro keep grinding

[@phoddaal7130]

Many Many Happy Returns of the Day 🥳🥳🥳

[@HypotheticaVision]

Happy Birthday broo...🎉🎉🎉

[@sahilanand30]

Happy Birthday Aryan 🎉

[@TON-108]

This playlist, gonna very helpful to final year students 🔥🔥

[@sukhpreetsingh5200]

Happy birthday bhaiya and awesome video

[@ashishgoyal6256]

Guru ji hppy wala bday 🙏🏿

[@abhaythakur9034]

Happy Birthday Bhaiya... Thanku for putting your next level efforts to provide such an amazing content.

[@ChiruBillion]

which year he is born? 2002?

[@omkumarjha2745]

Happy Birthday bhaiya

[@kushagramishra5638]

Happy BirthDay Bhaiya 🥳🥳🎉

[@nooob_coder]

happy birthday bro.. awesome video❤

[@djpsn7094]

Happy birthday and keep teaching us like this

[@riteshMusk]

happy birthdaay bhava ✨✨🎉🎉

[@sriramphysics5853]

Happy birthday Aryan

[@AkashKumar-bm4py]

Happy Birthday Bro🎉🍻

[@e2_04_abhijeetkumarsingh6]

Belated Happy Birthday Bhaiya

[@technologybash9104]

Happy Birthday broo 🎉🎉🎉🎉🎉🎉

[@ammanchhetri6716]

Happy Belated Birthday Bhai ;)

[@shivamkumarsingh9500]

Happy birthday bhaiya 🎂🎉✨❣️

[@suyashjadaun3279]

Happy Birthday Bhaiya...May your community become bigger.

[@ChiruBillion]

which year he is born? 2002?

[@yashkalia2311]

Happy Birthday bhai

[@krutikadave4534]

Good explanation. Thanks for all the knowledge.

[@sunny01111]

Happiest Birthday Bhaiya !!! keep growing!!

[@ChiruBillion]

which year he is born? 2002?

[@chaitanya812]

Happy birthday bro 🎉🥳

[@harikrushnasuhagiya3925]

Happy Birthday bro

[@playwithlinux]

Nice explanation bro...

[@lilgainz]

Happy Birthday to you bro

[@sarankumaar6009]

thanks for the video nice explanation

[@codingkart245]

what a coincidence, even I'm having birthday on 3rd Jan!!!!

[@atulwadhwa192]

didn't understand the bottom up

[@ShubhamGupta-li3qj]

broo please make the solution video of regular expression matching

[@Gungun-sx9rn]

can you please provide this pdf as well?

[@codencode5546]

Hey bro be lated Happy B'day!! My name is Amish and your b'day and mine is on same Day hahah 😄❤

[@ashishgoyal6256]

Guri ji ye matlab 100 days aap 1 question krwate jaaoge jo bohot jyada pucha gya.. if i am correct

[@justlc7]

Thanks bro, but i would request if you can share the pdf of the notes, would be grateful!

[@showsshorts4696]

what base condition is used i-j

[@ankitsihag6324]

can anybody tell me why (dp[l][r]!=-1) condition is used in DP solution during recursion?

[@frouMagician]

The subproblem or the recursion function that is running at some point in time, what if it had occured before ? so dp[i][j] stores the value of every subproblem and we check if its empty (containing -1) or does it contain the value or in other words, have we visited this subproblem before. If we have, there is no use of computing it again. So we return dp[i][j]. This is actually the crux of dp. Optimizing the exponential complexity by eliminating repeating subproblems.

[@djpro6413]

Not have proper explaining the problem clearly first solve the problem your own then teach the pseado code

[@reroyallover9169]

10:37 ak 47 on burst mode