Interview bit question

#1

Problem https://www.interviewbit.com/problems/sorted-permutation-rank/

my code is failing on Large test cases and I tried but couldn’t correct it plz help
my code>> https://ide.codingblocks.com/s/571863

#2

I already solved your code in other link

#3

problem I am
trying to find exact TC of my code
https://practice.geeksforgeeks.org/problems/longest-common-subsequence-1587115620/1

my code >>https://ide.codingblocks.com/s/574663

is time complexity O(2pow(len(s1)+len(s2))) or
O(2pow(len(s1)*len(s2))) ???

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.