5 Problems on Variations of Longest Common Subsequence | DP | Java DSA Placement Course #90

DSA-One Course - The Complete Data Structures and Algorithms Course - 5 Problems on Variations of Longest Common Subsequence | DP | Java DSA Placement Course #90

5.0 (0)

5 learners

What you'll learn

This course includes

25.3 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

lcs lcs dp dp dynamic programming variations of dp variations of lcs LCS Space Complexity Optimisation Minimum Insertions and Deletions to convert String Minimum Length of Supersequence of Strings Longest Repeating Subsequence Longest Palindromic Subsequence

Full Transcript

Hey guys, In this video, We're going to solve these 5 problems which are the variations of the Longest Common Subsequence Problem. 📍Join my paid Java DSA course here: https://www.codingshuttle.com/courses/batch/dsa-prime 📍Spring Boot 0 to 100 course: https://www.codingshuttle.com/courses/batchBundle/java-spring-boot-0-to-100/ 📍React 0 to 100 course: https://www.codingshuttle.com/courses/batchBundle/react-0-to-100/ 🚀 Follow me on: Instagram: https://www.instagram.com/Anuj.Kumar.Sharma Linkedin: https://www.linkedin.com/in/sharma-kumar-anuj/ X: https://x.com/sudoanuj 0:00 Introduction 0:35 LCS Space Complexity Optimisation 3:07 Minimum Insertions and Deletions to convert String s1 into s2 4:20 Minimum Length of Supersequence of Strings s1 and s2 6:00 Longest Repeating Subsequence 7:52 Longest Palindromic Subsequence Hashtags: #anujbhaiya #dsaone

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Welcome