#dailycodingchallenge 검색 결과

"#dailycodingchallenge"에 대한 결과가 없습니다

coder's snippet

9 시간

#DailyCodingChallenge Day 271 Task: Count all index pairs where the first digit of nums[i] and the last digit of nums[j] are coprime. Solution: Extract first & last digits, check gcd(first, last) == 1 for every (i < j), and count all valid beautiful pairs. #LeetCode

coder's snippet

@coder_s_Snippet

. 12. 11.

#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's tweet image. #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 &lt; j, check if words[j] starts and ends with words[i]. If yes, count it.
#LeetCode

"#dailycodingchallenge"에 대한 결과가 없습니다

Something went wrong.

United States Trends

1. #SmackDown 21.3K posts
2. Quinn Hughes 15.2K posts
3. Caine 31.5K posts
4. #TADC 81.2K posts
5. #TheLastDriveIn 1,092 posts
6. Rossi 12.9K posts
7. Rossi 12.9K posts
8. Vancouver 12.3K posts
9. #TheAmazingDigitalCircus 40K posts
10. Lash Legend 1,357 posts
11. Oba Femi 4,394 posts
12. Ciampa 1,955 posts
13. #MutantFam N/A
14. Kinger 8,700 posts
15. Billy G N/A
16. Darius Garland N/A
17. Lemon 37.1K posts
18. Lonzo N/A
19. Ilja 2,418 posts
20. Abel 20.2K posts