Leetcode - Largest Unique Number(Premium)

Leetcode - Largest Unique Number(Premium)

• Given an array of integers, identify the highest value that appears only once in the array. If no such number exists, return -1.

Solution

type Solution struct{}

func (sol Solution) largestUniqueNumber(A []int) int {
	freqMap := make(map[int]int)
	largestVal := -1
	for _, val := range A{
		freqMap[val]++
	}

	for _, val := range A{
		if freqMap[val]==1 && val>largestVal{
			largestVal= val
		}
	}
	return largestVal
}