Longest Increasing Subsequence LIS (DP) - Algorithm - Online Class - JnU - (Bangla)

preview_player
Показать описание
This video is done for reference purpose. Many of my students could not attend the class. So, I recorded my class so that they can see the lecture whenever they want.

Reference: Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. MIT Press, 2009.
Рекомендации по теме
Комментарии
Автор

Mam You are just amazing. These streams are too much helpful. Thanks a lot.

yusufsalehin
Автор

Mam Apnake onk dhonnobad. osadharon vabe describe korar jonno.

md.sajjadhossen.
Автор

আসসালামু আলাইকুম ম্যাম, ম্যাম আমি একজন বেসরকারি বিশ্ববিদ্যালয়ের এর ছাএ, স্যার ম্যাম পড়ানোর পর ও অনেক ডাউট থাকে, সেই জন্য Youtube এ আসা, ম্যাম ১০০ % ডাউট ক্লিয়ার হলো! ম্যাম অনেক ধন্যবাদ!!

almobin
Автор

Such a valuable work mam, , thanks you a lot.

prantomondol
Автор

I am student of CSE, Dhaka University..Your all the classes are very helpfull to me..Why are you not continue your classes, mam?

yourshawonn
Автор

Thank you so much mam it was very help for me to prepare upcoming final exm.
mam i have a question my sir advising in class that LIS to use prev then after use path. Should it better??

RatulRoy-wp
Автор

Salam Miss, i= index or input? and what about j? Please answer

MOSHIURRAHMANVLOG
Автор

Thank you mam . Your video helped a lot . Please consider uploading more

nazmulhossain
Автор

Madam Assalamualikum.Madam egg dropping(DP) problem r opor akta video dian.Thanks for the video

mdshafi
Автор

find the longest increasing subsequence from the given sequence.s= {11, 2, 14, 13, 7, 8, 15, 10, 12}
pls mam, solve these problem for me.

foodislifebd