kanzd

You’re given an integer array nums. A subarray is balanced if: #distinct even values in the subarray= #distinct odd values in the subarray Return the length of the longest balanced subarray. This “distinct” part is what makes the problem feel unfair at first: duplicates don’t increase the count, so a normal prefix-sum trick doesn’t work … Read more

Problem recap You’re given an integer array nums. A subarray is balanced if: Your task is to return the maximum length of any balanced subarray. A key detail: distinct matters. For example, in [3, 2, 2, 5, 4], the distinct even numbers are {2, 4} (count = 2), not 3. Constraints (important for choosing the … Read more

Problem statement Given the root of a binary tree, determine whether it is height-balanced. A binary tree is balanced if for every node: Formally, for each node:∣height(left)−height(right)∣≤1|height(left) – height(right)| \le 1∣height(left)−height(right)∣≤1 If this condition holds for all nodes, return true, otherwise return false. Why this problem is tricky Many people correctly check the height difference … Read more

If you’re doing your LeetCode daily streak and today you hit Question 1653 — “Minimum Deletions to Make String Balanced”, this one is all about turning a messy mix of a and b into a “clean” order with the fewest deletions. Let’s break it down like a human would, not like a textbook. What does … Read more

Problem recap You’re given an integer array nums and an integer k. A (non-empty) array is balanced if:max⁡(array)≤k⋅min⁡(array)\max(\text{array}) \le k \cdot \min(\text{array})max(array)≤k⋅min(array) You may remove any number of elements (but you cannot remove all of them). Return the minimum removals needed so the remaining array becomes balanced. Arrays of size 1 are always balanced. Constraints … Read more

Some LeetCode problems feel like math. 3379. Transformed Array feels more like a board game. Every position in the array gives you an instruction: Your job is to build a new array where each index i stores the value you land on after following nums[i] steps in a circular way. What the problem is really … Read more

If you’ve used ChatGPT (or any LLM chatbot), you already know the vibe: you ask a question, it answers. Helpful… but limited. Now imagine this instead: You give an AI a goal like “prepare a weekly sales summary, flag anomalies, and draft an email to my manager” — and it breaks the work into steps, … Read more

You’re given a 0‑indexed array nums (length n) and two integers k and dist. You must split nums into k disjoint contiguous subarrays. The cost of any subarray is simply its first element. You also have a constraint on where the later subarrays can start: If the subarrays start at indices 0 = s0 < … Read more

If you’ve ever built an API that touches money, inventory, emails, or basically anything “real,” you’ve already met the villain of this story: Retries. Retries happen everywhere—mobile networks, flaky Wi‑Fi, load balancers, gateway timeouts, client SDKs, message queues, cron jobs. And retries are the reason your “simple” endpoint can accidentally: Idempotency is the concept that … Read more

🔍 Problem Overview You are given an m x n matrix mat of non-negative integers and an integer threshold. Your task is to find the maximum possible side length of a square submatrix such that the sum of all its elements is less than or equal to threshold. Example 💡 Key Insight A brute-force approach … Read more