Palindromic Substrings | Leetcode 647 | Dynamic Programming | String | Palindrome | Imtiaj Rafi

Palindromic Substrings | Leetcode 647 | Dynamic Programming | String | Palindrome | Imtiaj Rafi

Imtiaj Rafi

54 года назад

21 Просмотров

What I've discussed in this video?. I've discussed about the Bruteforce and efficient Dynamic Programming approach to find palindrome substrings from a string.

problem Link: https://leetcode.com/problems/palindromic-substrings

0:00 Intro and Problem Statement
1:05 Brute Force Explanation
9:28 DP Soluiton

Leetcode: https://leetcode.com/Imtiaj_Rafi/
Codeforce handle: https://codeforces.com/profile/Imtiaz_rafi
Github handle: https://github.com/Imtiaz-Rafi

#leetcode #leetcodesolution #leetcodedailychallenge #problemsolving #coding #cpp #dynamicprogramming #string #palindrome #substring

Тэги:

#leetcode #leetcodesolution #leetcodedailychallenge #problemsolving #coding #cpp #programming #Imtiaj_Rafi #c++ #solving #preparation #google #interview #googleinterview
Ссылки и html тэги не поддерживаются


Комментарии: