DSA question 2, Q1) Given 2 strings s & t . You can perform to operations on s either take current character of string s or don't take current character of s and also delete the last taken character of s . You need to find out it is possible to convert s to t.(True /False) Q2) Dp question - you are given an array X . You need to create two arrays A (non-strictly incresing) and B(non-strictly decresing) such that for every index i ,A[i]+B[i]=X[i]. You need to return the number of such strings possible.
