Warehouse of Automobile Factory

Problem Statement

Warehouse of Automobile Factory Problem Description You are working in an automobile company and are required to sell automobile parts in the wholesale market. You are given two arrays - UniqueId[] of size N denoting the unique id of each automobile part. Profit[] of size N denoting the profit that can be earned by selling each part. Your task is to return the maximum profit that can be earned by selling the automobile parts in the market. Note: If two or more consecutive parts in the array UniqueId[] have the same id, then only the one amongst them with the maximum profit can be sold. Input Specification: input1 : An array of integers denoting the Unique ids of the automobile parts. input2 : An array of integers denoting the profit that can be earned per part. input3 : An integer N denoting the length of the arrays. Output Specification: Return an integer denoting the maximum total profit that can be earned by selling automobile parts. Examples Example 1: Input: input1 = [4,6,3,3,4],