🎉 1.5 years of challenging myself… and finally . 💪 Solved 700 LeetCode problems.
✅ Celebrating this milestone with a LeetCode T-shirt 👕.
Every line of code, every algorithm – a fruit of patience and hard work 🚀.
#CodingLife #LeetCode #Achievement

i am ready for tomorrow 👌 👌

Problem: Q1◀️
Status: Accepted
Mode: Easy🗽
Code: Kotlin🍽

class Solution {
    fun recoverOrder(order: IntArray, friends: IntArray): IntArray {
        val friendsSet = friends.toSet()
        val result = mutableListOf<Int>()

        for (id in order) {
            if (id in friendsSet) {
                result.add(id)
            }
        }

        return result.toIntArray()
    }
}

@leetcode @leetcode7 @contest #leetcode #weekly-465 #wcontest

Title: Q2. Balanced K-Factor Decomposition
Status: Medium 🧑‍⚕️
@leetcode #leetcode #contest #weekly

Problem: Q3. Maximum Product of Two Integers With No Common Bits ⚡️
Status: Medium 🏝
Code: Kotlin 🌚

class Solution {
    fun maxProduct(nums: IntArray): Long {
        val fenoraktil = nums 

        val n = nums.size
        var maxNum = 0
        for (v in nums) if (v > maxNum) maxNum = v

        var maxBits = 0
        while ((1 shl maxBits) <= maxNum) maxBits++
        if (maxBits == 0) maxBits = 1
        val size = 1 shl maxBits
        val fullMask = size - 1

        val top1Val = IntArray(size) { 0 }
        val top1Idx = IntArray(size) { -1 }
        val top2Val = IntArray(size) { 0 }
        val top2Idx = IntArray(size) { -1 }

        fun insertAt(mask: Int, value: Int, idx: Int) {
            if (idx == -1) return
            if (top1Idx[mask] == idx) {
                if (value > top1Val[mask]) top1Val[mask] = value
                return
            }
            if (value > top1Val[mask]) {
                top2Val[mask] = top1Val[mask]
                top2Idx[mask] = top1Idx[mask]
                top1Val[mask] = value
                top1Idx[mask] = idx
            } else if (idx != top1Idx[mask] && value > top2Val[mask]) {
                top2Val[mask] = value
                top2Idx[mask] = idx
            }
        }

        for (i in nums.indices) {
            val mask = nums[i]
            insertAt(mask, nums[i], i)
        }

        for (bit in 0 until maxBits) {
            val bitMask = 1 shl bit
            for (mask in 0 until size) {
                if ((mask and bitMask) != 0) {
                    val other = mask xor bitMask
                    val v1 = top1Val[other]; val i1 = top1Idx[other]
                    if (i1 != -1) insertAt(mask, v1, i1)
                    val v2 = top2Val[other]; val i2 = top2Idx[other]
                    if (i2 != -1) insertAt(mask, v2, i2)
                }
            }
        }

        var ans = 0L
        for (i in nums.indices) {
            val m = nums[i]
            val cm = fullMask xor m
            var partner = 0
            if (top1Idx[cm] != -1 && top1Idx[cm] != i) {
                partner = top1Val[cm]
            } else if (top2Idx[cm] != -1 && top2Idx[cm] != i) {
                partner = top2Val[cm]
            }
            if (partner > 0) {
                val prod = nums[i].toLong() * partner.toLong()
                if (prod > ans) ans = prod
            }
        }

        return ans
    }
}

@leetcode7 @leetcode @contest #weeekly

Problem: Q4. Sum of Beautiful Subsequences 🖥
Status: Hard (7pt) 🙌
@leetcode @leetcode7 #contest #weekly