Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Given two sorted arrays A and B of size M and N respectively. Each array contains only **distinct** elements but may have some elements in common with the other array. Find the maximum sum of a path from the beginning of any array to the end of any of the two arrays. We can switch from one array to another array only at the common elements.

Note: Only one repeated value is considered in the valid path sum.

**Example 1:**

**Input:
**M = 5, N = 4
A[] = {2,3,7,10,12}
B[] = {1,5,7,8}
**Output: **35**
Explanation: **The path will be 1+5+7+10+12
= 35.

**Example 2:**

**Input:
**M = 3, N = 3
A[] = {1,2,3}
B[] = {3,4,5}
**Output: **15**
Explanation: **The path will be 1+2+3+4+5=15.

**Your Task:**

You don't need to read input or print anything. Complete the function **max_path_sum()** which takes the two arrays A and B along with their sizes M and N as input parameters. It returns the maximum path sum.

**Expected Time Complexity: **O(M + N)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= M,N <= 10^{4}

1 <= A[i], B[i] <= 10^{4}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Max sum path in two arrays

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.