I would like to contribute a new problem statement and its solution to the project. Below are the details:
Problem Statement:
Given two sorted arrays of distinct integers, arr1 and arr2, each array may have some elements in common. The task is to find the maximum sum of a path from the beginning of any array to the end of any array. The twist is that you can switch from one array to another array only at the common elements. When switching, consider the common element only once in the result.
Please accept my PR and label it as hacktoberfest-accepted if my contribution is relevant.
I would like to contribute a new problem statement and its solution to the project. Below are the details:
Problem Statement:
Given two sorted arrays of distinct integers, arr1 and arr2, each array may have some elements in common. The task is to find the maximum sum of a path from the beginning of any array to the end of any array. The twist is that you can switch from one array to another array only at the common elements. When switching, consider the common element only once in the result.
Please accept my PR and label it as
hacktoberfest-acceptedif my contribution is relevant.