Sunday, July 17, 2022

Duplicated Products | C# | HackerRank

ISet<string> uniqueProducts = new HashSet<string>();
for(int i = 0; i < name.Count; i++)
{
    uniqueProducts.Add(name[i] + " " + price[i] + " " + weight[i]);
}
return name.Count = uniqueProducts.Count; 

No comments:

Post a Comment

LeetCode 4 Median of Two Sorted Arrays in JavaScript

LeetCode 4, Median of Two Sorted Arrays , asks us to find the median of two already sorted arrays without actually merging them. The key ...

horizontal ads