소프트웨어에 대한 모든 것

890. Find and Replace Pattern https://leetcode.com/problems/find-and-replace-pattern/ Find and Replace Pattern - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) class Solution: def findAndReplacePattern(self, words: List[str], pattern: str) -> List[str]: matched = [] uniq..

441. Arranging Coins 제목 문제) 솔루션1) class Solution: def arrangeCoins(self, n: int) -> int: row = 0 while n > 0: n -= row + 1 row += 1 if n == 0: return row elif n < 0: return row -1

260. Single Number III https://leetcode.com/problems/single-number-iii/ Single Number III - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 제목 문제) 솔루션1) HashMap or HashSet 자료구조를 통해서 중복을 제거하고 single number만 남겨서 문제를 해결한다. 아래 코드에서는 HashMap 사용. 시간 복잡도 : O(N) 공간 복잡도 : O(N) class Solutio..

1732. Find the Highest Altitude https://leetcode.com/problems/find-the-highest-altitude/ Find the Highest Altitude - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) class Solution: def largestAltitude(self, gain: List[int]) -> int: # The biker starts his trip on point 0 a..

797. All Paths From Source to Target https://leetcode.com/problems/all-paths-from-source-to-target/ All Paths From Source to Target - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) DFS 방법을 이용해서 재귀적으로 path를 탐색한다. class Solution: def allPathsSourceTarget(self, graph: List[..

1688. Count of Matches in Tournament https://leetcode.com/problems/count-of-matches-in-tournament/ Count of Matches in Tournament - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) 문제안에 정답이 있다. 짝수 - n/2 matches, n/2 teams advance 홀수 - (n-1) / 2 matches, (n-1)/2 + 1 teams a..

1342. Number of Steps to Reduce a Number to Zero https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/ Number of Steps to Reduce a Number to Zero - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) 모듈레이션 연산을 수행해서 나머지가 0이면 even, 아니면 odd even이면 나누기 2 연산, 아..

1877. Minimize Maximum Pair Sum in Array https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/ Minimize Maximum Pair Sum in Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) 오름차순 정렬 후 최소, 최대 pair를 계속 구해나가서 max를 구한다. class Solution: def minPairSum(self, n..