Palindrome Partitioning | Recursion | Backtracking | Dynamic Programming (From Better to Optimised)

preview_player
Показать описание
This video shows how we can solve the problem - Palindrome Partionning of a string using Recursion and Backtracking. Then how we can optimise the same problem using Dynamic Programming

The videos on my channel focuses heavily on how we can approach towards a problem after properly understanding the intuition behind the problem. Once you properly understand and know the approach you can write code in any programming language.

No prerequisite to watch this lecture, you just need to know a programming language and basic data structures.

00:34 Intuition
04:52 Approach
08:13 Coding
17:36 Optimisation using Dynamic Programming

Problem - 131. Palindrome Partitioning

#palindrome #partition
Рекомендации по теме
welcome to shbcf.ru