FastPrepFastPrep
Problem Brief

Number of Duplicates

OA

You are given a list of products, where each product has a name, price, and weight. Your task is to determine how many duplicate products are in the list. A duplicate product is defined as a product that has the same name, price, and weight as another product in the list.

Function Parameters:

name: A list of strings where name[i] represents the name of the product at index i.

price: A list of integers where price[i] represents the price of the product at index i.

weight: A list of integers where weight[i] represents the weight of the product at index i.

Returns:

An integer denoting the number of duplicate products in the list.

Constraints

  • 1 ≤ n ≤ 10^5
  • 1 ≤ price[i], weight[i] ≤ 1000
  • name[i] consists of lowercase English letters (a-z) and has at most 10 characters.

1Example 1

Input
name = ["ball", "box", "ball", "ball", "box"], price = [2, 2, 2, 2, 2], weight = [1, 2, 1, 1, 3]
Output
2
Explanation
"ball" at indices [0, 2, 3] have the same attributes (name = "ball", price = 2, weight = 1), so there are 2 duplicates. "box" at indices [1, 4] have different weights, so they are unique.

2Example 2

Input
name = ["ball", "box", "lamp", "brick", "pump"], price = [2, 2, 2, 2, 2], weight = [2, 2, 2, 2, 2]
Output
0
Explanation
Each product has unique attributes, so there are no duplicates.
public int numDuplicates(String[] name, int[] price, int[] weight) {
  // Write your code here
}
Input

name

["ball", "box", "ball", "ball", "box"]

price

[2, 2, 2, 2, 2]

weight

[1, 2, 1, 1, 3]

Output

2

Sign in to submit your solution.