Skip to content

Fix link for Print Shortest Common Supersequence #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Fix link for Print Shortest Common Supersequence #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,7 +44,7 @@ Sr | Problems | TryIt | Youtube
22 | [Min Insert Delete to convert A to B](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/22_Min_InsertDelete_to_convert_AtoB.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/cffabc15-9edb-48f5-979a-7032f0f8bbc2)](https://www.geeksforgeeks.org/problems/minimum-number-of-deletions-and-insertions0209/1) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/-fx6aDxcWyg?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
23 | [Longest Palindromic Subsequence](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/23_Longest_Palindromic_Subsequence.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/0adcfa0f-bdde-4c47-a616-510cb11ce0d0)](https://leetcode.com/problems/longest-palindromic-subsequence/) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/wuOOOATz_IA?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
24 | [Min Deletion to make String Palindrome](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/24_MinDeletion_toMakeString_Palindrome.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/cffabc15-9edb-48f5-979a-7032f0f8bbc2)](https://www.geeksforgeeks.org/problems/minimum-number-of-deletions4610/1) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/CFwCCNbRuLY?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
25 | [Print Shortest Common Subsequence](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/25_Print_shortestCommonSubsequence.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/0adcfa0f-bdde-4c47-a616-510cb11ce0d0)](https://leetcode.com/problems/shortest-common-supersequence/) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/VDhRg-ZJTuc?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
25 | [Print Shortest Common Supersequence](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/25_Print_shortestCommonSubsequence.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/0adcfa0f-bdde-4c47-a616-510cb11ce0d0)](https://leetcode.com/problems/shortest-common-supersequence/) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/VDhRg-ZJTuc?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
26 | [Longest Repeating Subsequence](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/26_Longest_Repeating_Subsequence.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/cffabc15-9edb-48f5-979a-7032f0f8bbc2)](https://www.geeksforgeeks.org/problems/longest-repeating-subsequence2004/1) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/hbTaCmQGqLg?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
27 | [Sequence Pattern Matching](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/27_Sequence_Pattern_matching.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/0adcfa0f-bdde-4c47-a616-510cb11ce0d0)](https://leetcode.com/problems/is-subsequence/) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/QVntmksK2es?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
28 | [Min Insertion to make string Palindrome](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/blob/main/28_MinInsertion_toMakeString_palindrome.cpp) | [![Problem Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/0adcfa0f-bdde-4c47-a616-510cb11ce0d0)](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/) | [![YouTube Link](https://github.com/yashk9293/Aditya-Verma-Dynamic-Programming/assets/90888884/3a973d84-2858-44d3-8059-0ca0835decc2)](https://youtu.be/AEcRW4ylm_c?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) | ✅
Expand Down