bitonic subsequence. You need to find the sum of the maximum sum path to reach from beginning of any array to end of any of the two arrays. You can switch from one array to another array only at common elements.
what does the above line mean?
what is bitonic subsequence? and further what does reach from beginning to end by switching mean?
ok… so all this ques wants is u are given 2 arrays… u start from any of the array and want to reach end of any array with max sum… but what u can do is in between if u are at any particular index and value of both arrays at that index is same u can switch/jump from one array to another…
u can refer this https://www.geeksforgeeks.org/maximum-sum-path-across-two-arrays/
it giving a wrong output basically
test case is running fine… is it showing error while submission??
yes it is showing compilation successful but after submitting test cases are not running
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.