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

Описание к видео 5. Longest Palindromic Substring | Day 001 | Brute - Better - Optimal | 2 Pointers | DP

In this video, I'll talk about how Leetcode 5. Longest Palindromic Substring

Problem Link: https://leetcode.com/problems/longest...
Checkout DSA-169 Series:    • Видео  
100Days 100k Placements:    • 100 Days 100K Placement  

Let's Connect:
📝Linkedin:   / aryan-mittal-0077  
📸 Instagram:   / ez.pz.dsa  
📱Telegram : https://t.me/aryan_mittal_group
🤖 Github: https://github.com/aryan-0077

About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 - Problem Explanation
2:28 - Method 1 - Brute Force
5:46 - Method 2 - Top Down DP
12:40 - Method 3 - Bottom Up DP
14:18 - Method 4 - 2 Pointer Approach
20:20 - Method 5 - Manachers Algo

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

Комментарии

Информация по комментариям в разработке