Media.net online coding question

Revision en2, by loverBoUy, 2022-07-27 19:55:00

Given a string of 1’s and 2’s, standing at index ‘i’, you can move exactly two steps forward or backward if s[i]==2 , else you can move one step forward or backward if s[i] ==1. A string is called a good string if you can reach the end of the string by moving every index exactly once.

Now, you have been given two Strings A and B (not necessarily good), you have to return the number of possible sub-sequences of swaps available, such that both the strings become good.

Swap means you can swap A[i] with B[i].

Example:

A = 2211 B = 1111 ans = 8

please share your thought! UPD: N<=10^3

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English loverBoUy 2022-07-27 19:55:00 18 Tiny change: 'r thought!' -> 'r thought!\n**UPD**: N<=10^3'
en1 English loverBoUy 2022-07-27 19:38:38 631 Initial revision (published)