Codenation : 14 Aug 2021 : On - Campus
CodeNation · Question · Posted Aug 2021
Problem 1 You are given two strings. A and B of same length. in one operation you can set some A[x) equal to B(x]. this cost 1 coin You can also Reverse a substring Ali. il atmost once. this cost C coins. Find minimum operation required to make both string Problem Constraints • 1 < |A| = |B| c= 1000 A and B consist of lower case alphabets • O <= C <= JAI Input Format First argument of input ...
The full answer & interview discussion are available to premium members.
Log in Create a free account