coder's snippet

@coder_s_Snippet

🚀 Daily Code Solutions | 🔥 Solving challenges | 🏆 LeetCode

India

於二月 2025 加入

273貼文 0位跟隨者 9個跟隨中

coder's snippet

@coder_s_Snippet

20 小時

#DailyCodingChallenge Day 270 Task: Check if the array forms a valid permutation of [1…n-1, n, n]. Solution: Find the max value n, ensure array size is n+1, count frequencies, confirm 1…n–1 appear once and n appears twice. #LeetCode

coder's snippet

@coder_s_Snippet

年12月10日

#DailyCodingChallenge Day 269 Task: Make the array sum divisible by k using minimum decrements. Solution: Find sum % k. If it’s 0, no change needed. Otherwise, that remainder itself is the number of operations required. #LeetCode

coder's snippet

@coder_s_Snippet

年12月9日

#DailyCodingChallenge Day 268 Task: Count how many pairs (i, j) satisfy: nums1[i] is divisible by nums2[j] * k. Solution: Loop through both arrays, compute num2 * k, and increment the count whenever num1 % product == 0. #LeetCode

coder's snippet

@coder_s_Snippet

年12月9日

#DailyCodingChallenge Day 267 Task: Convert a date (yyyy-mm-dd) into binary format without leading zeros. Solution: Split the date, convert year–month–day to binary using toBinaryString(), and join them back with dashes. #LeetCode

coder's snippet

@coder_s_Snippet

年12月7日

#DailyCodingChallenge Day 266 Task: Split each word using a given separator and return only non-empty parts. Solution: Manually parse characters: build substrings, add them when hitting the separator, and skip empty results. #LeetCode

coder's snippet

@coder_s_Snippet

年12月6日

#DailyCodingChallenge Day 265 Task: Determine who wins a coin-picking game where each move must total 115. Solution: Simulate turns: each round removes 1×75 + 4×10 coins. Whoever can't make the move loses. #LeetCode

coder's snippet

@coder_s_Snippet

年12月5日

#DailyCodingChallenge Day 264 Task: Find the smallest number ≥ n whose digit product is divisible by t. Solution: Start from n, compute each number’s digit product, and return the first one divisible by t. #LeetCode

coder's snippet

@coder_s_Snippet

年12月4日

#DailyCodingChallenge Day 263 Task: Decide if Alice can win by choosing either all single-digit numbers or all double-digit numbers. Solution: Sum single and double digits separately. Alice wins if either total is strictly greater than the other group. #LeetCode

coder's snippet

@coder_s_Snippet

年12月3日

#DailyCodingChallenge Day 262 Task: Count how many word pairs exist where one word is both a prefix and suffix of another. Solution: For every pair (i, j) with i < j, check if words[j] starts and ends with words[i]. If yes, count it. #LeetCode

coder's snippet

@coder_s_Snippet

年12月2日

#DailyCodingChallenge Day 261 Task: Verify if the grid follows two rules: each value must match the value below it and differ from the one to its right. Solution: Loop through all cells and check both conditions, return false on any violation, otherwise return true. #LeetCode

coder's snippet

@coder_s_Snippet

年12月1日

#DailyCodingChallenge Day 260 Task: Find all missing numbers between the smallest and largest values in the array. Solution: Identify the min and max, then check each number in that range and collect the ones not present. #LeetCode

coder's snippet

@coder_s_Snippet

年11月30日

#DailyCodingChallenge Day 259 Task: Pair the smallest and largest numbers, compute their average each time, and return the smallest of those averages. Solution: Sort the array, use two pointers from both ends, calculate averages, and track the minimum. #LeetCode

coder's snippet

@coder_s_Snippet

年11月29日

#DailyCodingChallenge Day 258 Task: Find the longest subarray where the product of all elements equals gcd(arr) × lcm(arr). Solution: Check every possible subarray, maintain running product, GCD, and LCM, and update the answer when the condition holds. #LeetCode

coder's snippet

@coder_s_Snippet

年11月28日

#DailyCodingChallenge Day 257 Task: Count how many original strings Alice could have meant before accidentally holding a key too long. Solution: Group repeating characters, each extra duplicate adds one possible original version, sum all possibilities. #LeetCode

coder's snippet

@coder_s_Snippet

年11月27日

#DailyCodingChallenge Day 256 Task: Identify the first adjacent pair where both digits occur in the string exactly as many times as their numeric value. Solution: Count digit frequencies → scan pairs from left to right → return the first valid pair. #LeetCode

coder's snippet

@coder_s_Snippet

年11月26日

#DailyCodingChallenge Day 255 Task: Count how many ways we can start from a zero value and move left or right so that all elements eventually become zero. Solution: Try every zero index, simulate movement in both directions, and count valid outcomes. #LeetCode

coder's snippet

@coder_s_Snippet

年11月25日

#DailyCodingChallenge Day 254 Task: Count how many integer points on a number line are covered by at least one car interval. Solution: Use a boolean array to mark every point from start to end for each car. Each point is counted only once, even if multiple cars overlap. #LeetCode

coder's snippet

@coder_s_Snippet

年11月24日

#DailyCodingChallenge Day 253 Task: Determine which bit positions are set in at least k numbers from the array and build the result using those bits. Solution: For each bit, count how many numbers have that bit set. If count ≥ k → set that bit in the final answer. #LeetCode

coder's snippet

@coder_s_Snippet

年11月23日

#DailyCodingChallenge Day 252 Task: Find the island’s perimeter by counting exposed edges of land cells. Solution: Add 4 for every land cell. For each land cell that shares a side with another land cell (right or down), subtract 2 from the total perimeter. #LeetCode

coder's snippet

@coder_s_Snippet

年11月22日

#DailyCodingChallenge Day 251 Task: Determine whether all given points lie on the same straight line in the 2D plane. Solution: Compute the slope using the first two points, then check every other point using cross-multiplication to ensure all slopes match. #LeetCode