Moksh_grover's blog

By Moksh_grover, history, 4 years ago, In English

Problem Statement

Given three strings p, q, r. Count the possible number of ways to create string r using string p and string q such that,the order of the selected characters in all the strings is preserved and atleast one characters from both the string is selected.

Constraint

  • Strings will have max length 100
  • They will consist of lowercase english alphabets.
  • Return the answer modulo 10^9+7

Sample Test Case

  • p :"ab"
  • q :"ba"
  • r :"aba"

Output : 2

Explanation

Two ways to form aba :
1. from p 'a' ,from q 'ba'
2. from p 'ab' ,from q 'a'

This problem was asked in recent coding rounds .Can somebody help me with the solution?

Full text and comments »

  • Vote: I like it
  • +2
  • Vote: I do not like it