IT/알고리즘90 76] ★ Leetcode 1071. Greatest Common Divisor of Strings Kotlin https://leetcode.com/problems/greatest-common-divisor-of-strings/description/ Greatest Common Divisor of Strings - LeetCode Can you solve this real interview question? Greatest Common Divisor of Strings - For two strings s and t, we say "t divides s" if and only if s = t + ... + t (i.e., t is concatenated with itself one or more times). Given two strings str1 and str2, return t leetcode.com 두 문자.. 2023. 4. 11. 75] Leetcode 2413. Smallest Even Multiple Kotlin 양의 정수 n이 주어질때, 2와 n의 최소공배수를 return하는 문제 class Solution { fun smallestEvenMultiple(n: Int): Int { if(n % 2 == 0){ return n } else { return n*2 } } } 2023. 4. 10. 74] Leetcode 2574. Left and Right Sum Differences Kotlin https://leetcode.com/problems/left-and-right-sum-differences/description/ Left and Right Sum Differences - LeetCode Can you solve this real interview question? Left and Right Sum Differences - Given a 0-indexed integer array nums, find a 0-indexed integer array answer where: * answer.length == nums.length. * answer[i] = |leftSum[i] - rightSum[i]|. Where: * leftSum[i] is leetcode.com 배열이 주어지고 왼쪽에.. 2023. 4. 6. 73] Leetcode 2011. Final Value of Variable After Performing OperationsEasy1.1K151 #Kotlin https://leetcode.com/problems/final-value-of-variable-after-performing-operations/description/ Final Value of Variable After Performing Operations - LeetCode Can you solve this real interview question? Final Value of Variable After Performing Operations - There is a programming language with only four operations and one variable X: * ++X and X++ increments the value of the variable X by 1. * --X.. 2023. 4. 5. 이전 1 2 3 4 5 6 7 8 ··· 23 다음
