String Problem Again !!!
Practice
0 (0 votes)
Medium
Problem
87% Success 702 Attempts 30 Points 10s Time Limit 1024MB Memory 1024 KB Max Code

You are given 2 strings and you have to find the Longest  Common Subsequence between them provided you can change atmost K characters in first string.

40% Test Case contains  K=0

Input:-

First line contain string s

Second line contain string t

Third Line contain integer K.

Output:-

1 Integer - Maximum Length of Longest  Common Subsequence.

Constraint:-

1<=|s| ,|t|<=2000

0<=K<=5

 

Please login to use the editor

You need to be logged in to access the code editor

Loading...

Please wait while we load the editor

Loading...
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:30
25 votes
Tags:
Dynamic ProgrammingAlgorithmsMedium
Points:30
106 votes
Tags:
Dynamic ProgrammingOpenApprovedMedium
Points:20
24 votes
Tags:
ApprovedEasyImplementationOpenSorting
Editorial

No editorial available for this problem.