Given two arrays a and b of equal size of n, find the maximum sum possible of a window in b such that the elements at the same window positions in a are all unique.Examples: Input: a = [0, 1, 2, 3, 0, 1, 4], b = [9, 8, 1, 2, 3, 4, 5]Output: 20Explanation: The maximum sum occurs for
This is a summary. For the full story, refer to the original source. Public of India presents verified citizen-relevant reporting.