Maximum Sum Path in Array

#1

what is question trying to say…what sum i have to calculate???.. I am not able to understand

#2

you have to calculate sum of path which you are going to follow

For Input
1
8 8
2 3 7 10 12 15 30 34
1 5 7 8 10 15 16 19

best path which will give max sum path is
1+5+7+8+10+12+15+30+34 = 122

#3

but why after 15 we switched to 30 and 34??? if we were going for only one path then why we switched in between

#4

we didn’t switch at 15
switching happens at 7 and then at 10

you can switch the path to get max path sum

#5

https://ide.codingblocks.com/s/641438 This is my code and it’s not passing the test case please help me in this

#6

is there any TA availaible please help me my test case is not getting passed anyone please???

#7

you are not doing with anything with t (no of testcases)

you have to solve the problem for t different inputs.

like this

#8

thank you saurabhbsir so much i am gonna try this now and will check if this is passing or not

#9

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.