Longest Palindromic Substring | Leetcode 5 | Live coding session

preview_player
Показать описание
Here is the solution to "Longest Palindromic Substring" leetcode question.
Hope you have a great time going through it.

🎉 Chapters
1) 0:00 Explaining the problem out loud
2) 1:28 Algorithm walkthrough
3) 5:00 Coding it up
4) 10:00 Time complexity

TC : O(n2)
SC:O(1)

🔥Solution

Check this out 🔽🔽🔽🔽

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

👉 Solutions

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series: 🔥🔥🔥

🔥🔥🔥 Leetcode Monthly Contest Playlist

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

I like how you keep the solutions small and to the point, not like unnecessary long stuff. Really appreciate that I have also added you on LinkedIn!.

RajatSingh-dgov