Longest Common Subsequence- Dynamic Programming | Data structures and algorithms
ฝัง
- เผยแพร่เมื่อ 18 ก.ย. 2024
- In this video, I have explained the procedure of finding out the longest common subsequence from the strings using dynamic programming(Tabulation method). It is also known as bottom-up approach.
Jenny’s Lectures CS/IT NET&JRF is a Free TH-cam Channel providing Computer Science / Information Technology / Computer-related tutorials including Programming Tutorials, NET & JRF Coaching Videos, Algorithms, GATE Coaching Videos, UGC NET, NTA NET, JRF, BTech, MTech, Ph.D., tips and other helpful videos for Computer Science / Information Technology students to advanced tech theory and computer science lectures, Teaching Computer Science in Informal Space. Learning to teach computer scienceoutside the classroom….
TH-cam a top choice for users that want to learn computer programming, but don't have the money or the time to go through a complete college/ Institute / Coaching Centre course. ... Jenny’s Lectures CS/IT NET&JRF is aFree TH-cam Channel providing computer-related ... and educate students in science, technology and other subjects.
Main Topics:
Algorithms, Applied Computer Science, Artificial Intelligence, Coding, Computer Engineering, Computer Networking,Design and Analysis Of Algorithms, Data Structures, Digital Electronics, Object Oriented Programming using C++/Java/Python, Discrete Mathematical Structures, Operating Systems Computer Simulation, Computing, Bit Torrent, Abstract, C, C++, Acrobat, Ada, Pascal, ADABAS, Ad-Aware, Add-in, Add-on, Application Development, Adobe Acrobat, Automatic Data Processing, Adware, Artificial Intelligence, AI, Algorithm, Alphanumeric, Apache, Apache Tomcat, API, Application Programming Interface, Applet, Application, Application Framework, Application Macro, Application Package, Application Program, Application Programmer, Application Server, Application Software, Application Stack, Application Suite, System Administrator, Ada Programming, Architecture, computer software, ASP, Active Server Pages, Assembly, Assembly Language, Audacity, AutoCAD, Autodesk, Auto sketch, Backup, Restore, Backup & Recovery, BASH, BASIC, Beta Version, Binary Tree, Boolean, Boolean Algebra, Boolean AND, Boolean logic, Boolean OR, Boolean value, Binary Search Tree, BST, Bug, Business Software, C Programming Language, Computer Aided Design, Auto CAD, National Testing Agency, NTA,CAD, Callback, Call-by-Reference, Call by reference, Call-by-Value, Call by Value, CD/DVD, Encoding, Mapping, Character, Class, Class Library, ClearCase, ClearQuest, Client, Client-Side, cmd.exe, Cloud computing, Code, Codec, ColdFusion, Command, Command Interpreter, Command.com, Compiler, Animation, Computer Game, Computer Graphics, Computer Science, CONFIG.SYS, Configuration, Copyright, Customer Relationship Management, CRM, CVS, Data, Data Architect, Data Architecture, Data Cleansing, Data Conversion, Data Element, Data Mapping, Data Migration, Data Modeling, Data Processing, Data Scrubbing, Data Structure , Data Transformation, Database Administration, Database Model, Query Language, Database Server, Data log, Debugger, Database Management System, DBMS, Data Definition Language, DDL, Dead Code, Debugger, Decompile, Defragment, Delphi, Design Compiler, Device Driver, Distributed, Data Mart, Data Mining, Data Manipulation Language, DML, DOS, Disk Operating System, Dreamweaver, Drupal, Data Warehouse, Extensible Markup Language, XML, ASCII, Fibonacci , Firefox, Firmware, GUI, Graphical User Interface, LINUX, UNIX, J2EE, Java 2 Platform, Enterprise Edition, Java, Java EE, Java Beans, Java Programming Language, JavaScript, JDBC, Java Database Connectivity, Kernel, Keyboard, Keygen, LAMP, MySQL, Perl, PHP, Python, Logic Programming, Locator, Fusion, Fission, Low-Level Language, Mac OS, Macintosh Operating System, Machine Code, Machine Language, Metadata, Microsoft Access, Microsoft .Net Framework, Microsoft .Net, Microsoft SQL Server, Microsoft Windows, Middleware, MIS, Management Information systems, Module, Mozilla, MS-DOS,Microsoft Disk Operating System, Magic User Interface, MUI, MySQL, Normalization, Numerical, Object-Oriented, Open Source, Solaris, Parallel Processing, Parallel, Patch, Pascal, PDF, Portable Document Format, Postgres, Preemptive, Program, Programming Language, QuickTime, Report Writer, Repository, Rewind, Runtime, Scripting Languages, Script, Search Engine, Software Life-Cycle, VBScript, Virtual Basic Script, Classes, Queues, Stack, B-Tree, Computer Science, Information Technology, IT, CSE Quora profile: www.quora.com/...
Find me on Instagram: / jayantikhatrilamba
Hi mam, The way you teach make simple and easy way of understanding the complicated topics! you have such a teaching talent.!!Thanks for the video.
All credit for passing my Algorithm Analysis course goes to Jenny ma'am.
I returned to your channel and lecture after 1 month and it felt like I am home atlast for learning DAA & DSA. Thank you ma'am from the bottom of my heart, you are the reason I am able to grasp these topics and learn DAA and DSA. I will be grateful to you.
Setup
Shatop😂
🌝
Great explanation. The key to understanding these types of questions is the ability to visualize. Once visualization happens the algorithm become a cakewalk.
No one has explained in such simplicity. Thanks a lot for your efforts.
I am from Bangladesh . Your lecture is just wonderful
Ma'am, I just wish I could learn all gate subjects from you Face to face, you make these topics so much easy and crystal clear !! Lots of respect to you 🙏
what is GATE? Aren't these FAANG interview questions?
The way of explaining is another level, thanks Ma'am for wonderful explanation 👍👍
really nyc tuto,u cleared all my doubts of max(4,4)
Thank you so much ... 2hours left for online exam and using this video
i did this problem in 7 min only thank uh
i know only java but this explaination is top class. everything crystal clear. please make video on java and DSA also
TIP : WATCH VIDEO AT 1.25X PLAYBACK SPEED..... ✌🏻 THANK ME LATER
Bhai 1.5x mein bhi slow lgta hein mujhe😅
@@bollywoodworld1852 and me already watching in 1.75x
1.75
Thank you
I read your comment and go to change the playback speed and i see I'm already watching it at 2x 😂😂
You have an excellent pedagogy at explaining algorithms. Thanks
Thanks mam for easy explanation ❤❤
(2^n-1) subsequences are possible except 0 length string. Thank you madam..
Excellent mam. we need more tutorials from you over Computer science
Thank you, so much for explaining it in a very easy way. Channel subscribed+bell button clicked.
thanks , u and ur expalination is too good
Thanku Mam it was awesome session i understand well this topic. thanku mam
Mam,you are really a boon for us.Keep smiling ........forever.
Love the explanations ❤❤❤
your teaching is very amzing your approach is too good you looking gorgeous thank you for teaching easily and intrestly....
🥰🤩😇☺
Gooodddd!!!, you explain better than my teacher that also explain very well!!
Thank you very much mam. Your lectures only helped me to both understand the concepts and to write the exam
TH-cam..I want 10X speed 🙇♂️.
Great teacher. Would it be possible for you to explain the egg drop problem.
thank you for this wonderful explaration 😊😊😊😊😊😊😊😊
please please please complete this dynamic programming series/playlist🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
Thank you so much, great explanation.
Kindly explain it with recursion and memoization
thanks a lot mam very nice explaining this video help me a lot to understand the concept love you mam
This is the best tutorial I have seen on this topic. You explain the basics best in your videos Ma'am.
very helpful in "Analysis of Algorithms" thank you ma'am..
beauty with brain is always dangerous ...dear respected mam...teaching methodology is just great
mam, thank you for the explanation. You have explained how to fill the table clearly but you should also have explained the conditions such as why we increment value of previous diagonal element for current element and other conditions also, how should we think about this algorithm and all
Thank you! It is clear and easy to understand!
Mam yours lecture is very helpful but please change the camera your video is very brightness and the word you write on whiteboard is some time blur
really you are the best lecturer among all keep it up love you so much!!!!
Beautifully explain by You
Thanks mam both combined spoke in English and Hindi , i understood this topic
sequence means in order as they are present
subsequence means either part of the string or whole string (like set and subset in literal meaning)
best step by step explanation !!!
yippeeeeee, so lovely video. you are the best hindi teacher
thank you for the great explanation really i am going to pass my exam becuase of you
Thank you for your efforts ma'am. The shared videos are very helpful and easy to understand. Please keep doing good work.
You are such a great teacher ma'am ❤️
ma'am such a great teacher u are.........thank uh .....😍😍😍😍
so simply explained mam....as always😘 thankyou !
Now only My concept is clear. Big Thank you Jenny Ma'am.
I watched the topic Frist from Abdul Bari sir but I couldn't understand the topic from him but after watching your video the topic is becoming so simple for me.Thank you mam❤
Same happened with me but I also couldn't understand topic from him
Brilliant and easy to grasp,thankyou
Crystal clear explanation!
Great explanation ❤
Awesome maam ur teaching techniques are very very efficient and effective
Lots of thanks!!! Before watching this video, I thought I would never understand this algorithm :)
Thanks a lot! You made it very simple to understand.
Video is useful
Thanks for the video. Well understood this algorithm!!!
thank you ma'am ,if you don't make these videos then i could never get the subjects,i see maximum of your videos they really help me a lot
Thanks mam
Please make videos on backtracking
Your videos are awesome! Clear and concise
Everything is crystal clear mam...
Excellent mam. All concepts Learned.
Okey mam thnq... Only you can make me understand this topic........
Thank you maam finding the proper dp visualization for me,THanks A LOTTTT mam!!
Thank you so much ma'am ❤️ now it's very easy to understand 🙂
Nice lecture very easy to understand
thanks Ma'am
I am from Pakistan.
Video quality 360p. Content quality 1000k
Excellent Explanation. Thankyou
Thank you so much much mam , we love your way to teaching ,its excellent
After this video I am goona subscribe this channel very good explained mam♥️
you are making great effort to explain the topic , Nice Explanation
Thank you ,in this lockdown your lectures helped me a lot .
Wonderful explanation i have ever seen ❤
You are the best!
concept of lcm is clear . thank you
So Nice and easy method.Thanks
Thank you for all your videos, please make more videos on dynamic programming, it is a complicated topic for me and your explanations are the best
lovely video and great explanation maam. Keep it going with each and every subject ❤❤❤❤❤
Great Explanation!
I love you mam 😁
The way you explain things has made me fall in love with you 💗💗
Thank you maam
explanation method is outstanding...!
Mam also make provide on matrix chain multiplication algo.
Excellent, thank you!
Love you mam
This is 7 mark question for my 70 marks exam paper.
10% in 20 minute
thanks didi i learned a lot from you
Thank you ma'am.....your lectures are just amazing.
very Nice explanation
Nice Explanation. But how the problem is solved using this matrix? Means how can we think that it can be solved creating such matrix?
Surprisingly nobody asked this question and everyone simply accepted the formula! None of the youtube videos explains why a matrix is used for this problem! :(
In the matrix a[i][j] represents the value of max common subsequence when we take the first i characters of string a and j characters of string b. we start from 1st char of string a and b. now from these value we derive what if one more character is added to either of the strings.
@@AbdulRehman-ew5fu that is called dynamic programming it's a method to solve very complex programming questions
@@hareeshr3979 thanks a lot..🙏🙏 I'm amazed
thanks ma'am, this video is very helpful for understanding this topic
Nicely explained
Thank u very much mam.GOD bless u with most desirable thing for u
Excellent Mam😊
Thanks your explanation is awesome.
Thank You Mam, your lectures so helpful.
Thank you so much mam for clearing this topic for me! 💐🌹
Nice explanation in detail
It's excellent mam
Perfect!
thanks mam really helpful i think 7 mark is confirm for tomorrow exam
Thank you ma'am you explained it very clearly