Please solve my doubt

Revision en1, by anshu2002, 2022-08-02 16:47:10

the question is , two strings are given s1 and s2 . You have to find minimum number of insertions to be done at the end of s1 so that s2 becomes a subsequence of s1

test #1 s1: armaze s2: amazon ans : 2

test #2 s1: armazen s2: amazon ans : 2


  Rev. Lang. By When Δ Comment
en1 English anshu2002 2022-08-02 16:47:10 276 Initial revision (published)