Algorithmic Problem Solving with Kotlin HashMap

Welcome back! Today, we're sharpening our algorithmic problem-solving skills, focusing on HashMap in Kotlin. Picture HashMap as the backbone of a social network app, ensuring that each user's data remains unique and instantly accessible. By the end of this lesson, you will be equipped to use Kotlin's HashMap to efficiently solve problems that might otherwise seem daunting due to their complexity or data size.

Our journey begins with the Majority Element Finder. You're handed an array of integers, and your mission is simple yet intriguing: determine whether this array has a celebrity element. This integer appears more frequently than all others combined. More formally, we are looking for an element appearing more than n/2 times.

Why does this matter? Well, consider analyzing sales data to determine the most sold product in an online marketplace — knowing the majority of products could streamline marketing strategies and inventory management. That's the real-world relevance of the majority element problem.

Now, let's be savvy about this. Enter the HashMap: your sophisticated voting tally system. With it, you can keep a running total of each product's sales as you go through the transaction list once, rather than reviewing the entire list for each product. It grants us the speed of an experienced cashier who knows customers' habits by heart.

Let's dissect the process in our election analogy step by step:

val countMap = HashMap<Int, Int>()
val majorityThreshold = arr.size / 2

Here, we're preparing our HashMap, akin to setting up our ballot boxes and establishing the majority threshold — the number of votes needed to win the election by a landslide.

for (num in arr) {
    if (countMap.containsKey(num)) {
        countMap[num] = countMap.getValue(num) + 1
    } else {
        countMap[num] = 1
    }

We're recording every vote cast in our HashMap ledger. Each key is a unique product, and the value is the current total of received votes.

    if (countMap.getValue(num) > majorityThreshold) {
        return num
    }
}

Once a product's vote count exceeds the threshold — signaling a majority — our search concludes, akin to declaring a winner!

fun findMajorityElement(arr: IntArray): Int {
    val countMap = HashMap<Int, Int>()
    val majorityThreshold = arr.size / 2

    for (num in arr) {
        if (countMap.containsKey(num)) {
            countMap[num] = countMap.getValue(num) + 1
        } else {
            countMap[num] = 1
        }

        if (countMap.getValue(num) > majorityThreshold) {
            return num
        }
    }

    return -1
}

If the polling ends with no majority victor, we return -1, signifying a contested market where no single product dominates.