전체 글 (2354) 썸네일형 리스트형 (Python3) - LeetCode (Easy) : 3014. Minimum Number of Pushes to Type Word I https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i Minimum Number of Pushes to Type Word I - LeetCodeCan you solve this real interview question? Minimum Number of Pushes to Type Word I - You are given a string word containing distinct lowercase English letters. Telephone keypads have keys mapped with distinct collections of lowercase English letters, whicleetcode.com비둘기집 원리를 생.. (Python3) - LeetCode (Medium) : 3517. Smallest Palindromic Rearrangement I https://leetcode.com/problems/smallest-palindromic-rearrangement-i Smallest Palindromic Rearrangement I - LeetCodeCan you solve this real interview question? Smallest Palindromic Rearrangement I - You are given a palindromic string s. Return the lexicographically smallest palindromic permutation of s. Example 1: Input: s = "z" Output: "z" Explanation: A string of oleetcode.com정렬을 통해 해결한 문제였습니다.. (Python3) - LeetCode (Easy) : 3536. Maximum Product of Two Digits https://leetcode.com/problems/maximum-product-of-two-digits Maximum Product of Two Digits - LeetCodeCan you solve this real interview question? Maximum Product of Two Digits - You are given a positive integer n. Return the maximum product of any two digits in n. Note: You may use the same digit twice if it appears more than once in n. Example 1: Inputleetcode.com구현 문제였습니다📕 풀이방법📔 입력 및 초기화📑 입.. (Python3) - LeetCode (Medium) : 3867. Sum of GCD of Formed Pairs https://leetcode.com/problems/sum-of-gcd-of-formed-pairs Sum of GCD of Formed Pairs - LeetCodeCan you solve this real interview question? Sum of GCD of Formed Pairs - You are given an integer array nums of length n. Construct an array prefixGcd where for each index i: * Let mxi = max(nums[0], nums[1], ..., nums[i]). * prefixGcd[i] = gcd(nums[i], mxleetcode.com유클리드 gcd 구현해보고 자료구조와 정렬해보는 문제였습니다.📕.. 2026-07-10 금 보호되어 있는 글입니다. 2026-07-04 보호되어 있는 글입니다. 2026-07-03 보호되어 있는 글입니다. 2026-07-02 보호되어 있는 글입니다. 이전 1 2 3 4 ··· 295 다음