Longest Palindromic Subsequence - Leetcode 516 - Python

preview_player
Показать описание
This video talks about solving a leetcode problem which is called Longest Palindromic Subsequence. This question asked in many top companies.

We will see more videos on solving leetcode problems, which are asked in interviews from top companies (MAANG)

Like 👍
Share 📣
Comment 💬
Press the Bell icon🔔for updates

#python #leetcode #coding #programming
Рекомендации по теме
Комментарии
Автор

Like 👍
Share 📣
Comment 💬
Press the Bell icon🔔for updates

techerror
Автор

firstly, why are we using this procedure, can anyone tell me why we chose dp, why 2 arrays and the process behind creating new dp everytime and copying the data in that to old dp... why??

iamlegend
Автор

Can we solve this problem without using dp approach?

prog