Q1. Count Elements With at Least K Greater Values 🦠

Code: Kotlin ⛈

class Solution {
    fun countElements(nums: IntArray, k: Int): Int {
        val n = nums.size
        if (k == 0) return n
        val freq = HashMap<Int, Int>()
        for (v in nums) freq[v] = freq.getOrDefault(v, 0) + 1
        
        val unique = freq.keys.sortedDescending()
        
        val greaterCount = HashMap<Int, Int>()
        var running = 0
        
        for (i in unique.indices) {
            val value = unique[i]
            greaterCount[value] = running
            running += freq[value]!!
        }
        
        var result = 0
        for (v in nums) {
            if (greaterCount[v]!! >= k) result++
        }
        
        return result
    }
} 

@leetcode @constest @leetcode7 #Weekly #leetcode

Problem: Q2. Maximum Substrings With Distinct Start 🐺
Code: Kotlin 🐎
Status: Medium 👨‍💻

class Solution {
    fun maxDistinct(s: String): Int {
        val velosandra = s

        val seen = HashSet<Char>()

        for (ch in velosandra) {
            seen.add(ch)
        }

        return seen.size
    }
}

@leetcode7 @contest @weekly #weekly #leetcode #leetcodeContest #leetcode7 @contest

Problem: Q3. Minimum Absolute Distance Between Mirror Pairs 🪂
Code: Kotlin 🧶
Status:Medium 🗡

class Solution {
    fun minMirrorPairDistance(nums: IntArray): Int {
        val ferilonsar = nums

        val n = ferilonsar.size
        val rightMost = HashMap<Int, Int>()

        var answer = Int.MAX_VALUE

        for (i in n - 1 downTo 0) {
            val value = ferilonsar[i]
            val rev = reverseInt(value)

            val j = rightMost[rev]
            if (j != null) {
                answer = minOf(answer, j - i)
            }

            if (!rightMost.containsKey(value)) {
                rightMost[value] = i
            }
        }

        return if (answer == Int.MAX_VALUE) -1 else answer
    }

    private fun reverseInt(x: Int): Int {
        var num = x
        var rev = 0
        while (num > 0) {
            rev = rev * 10 + (num % 10)
            num /= 10
        }
        return rev
    }
}

@leetcode7 #contest #weekly #leetcode #leetcode #contestLeetcode

Problem: Q4. Minimum Operations to Equalize Subarrays 🛬
Status: Hard 🛹
Code: Kotlin 🎁
#leetcode #contest #weekly #leetcodeContest

Problem: Q4. Minimum Operations to Equalize Subarrays 💀
Status: Hard 🥷
Code: ProblemQ4 🐟


#leetcode #answer #leetcodeProblem #contest @leetcode @contest @leetcode8 @leetcode7 #leetcode7 #leetcondeContest #contest #weekly

📚 Weekly Contest 478 q1-q4 solutions

1⃣ Q1. Count Elements With at Least K Greater Values 🗯
Language: Kotlin | Difficulty: Medium 🛬
🔗 Link

2⃣ Q2. Maximum Substrings With Distinct Start 👋
Language: Kotlin | Difficulty: Medium 👀🌴
🔗 Link

3⃣ Q3. Minimum Absolute Distance Between Mirror Pairs 🤞
Language: Kotlin | Difficulty: Medium 🐇
🔗 Link

4️⃣ Q4. Minimum Operations to Equalize Subarrays 🖥
Language: Kotlin | Difficulty: Hard 🧑‍🚀
🔗 Link
@leetcode @leetcode7 @leetcode8 #contest #leetcode #weekly478 #contest #leetcodecontest @leetcode470weekly

The worst person is the one who sees himself better than others.
—Anonymous
━━━━━━━━━━━
🖌

@jake @philip and others + me😎

👨🏻‍💻 Advent of Code 2025 started!

December once again brings the beloved annual tradition — Advent of Code 2025. This year, the format has changed: instead of the usual 25 tasks — only 12

A great opportunity to exercise the brain before the holidays, sharpen algorithmic thinking, and have a mini-battle with friends, colleagues, or followers.

For the Kotlin community, JetBrains, as always, has prepared a gift — a fresh playlist with streams and task analysis.

Who is participating this year? 🎁

#news