Dhokhebaz Prasun

CodeChefOpen on judge ↗

All solutions to this problem are rejudged.Please check your verdict Prasun never does any work which he promises to do.He took this problem to upload but refused to upload it just before the contest.The problem is as follows: You are given two strings S, P and two integers, K1, K2. You have to find the length of the longest common subsequence after performing at-most K1 operations on string S a

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI