작심삼일

GPS 인공위성 인공위성 인공위성 가문비 바늘 나무 가발 머리 머리 가솔린 석유 증기 가위 칼날 칼날 가죽 망치 돼지 갈매기 새 바다 갈퀴 빗 막대기 갑옷 옷 금속 강 흙 물 물 개 사람 늑대 개구리 생명 늪 개집 개 집 거머리 혈액 지렁이 거미 곤충 곤충 거미줄 파리 거미 거북이 계란 모래 거울 유리 빛 물 거품 비눗방울 물 건강 사과 사람 건초 잔디 열 건포도 포도 열 검 칼날 막대기 게 물고기 가위 견섬유 애벌레 실 계란 새 새 계란 후라이 계란 불 고기 칼날 소 고기 분쇄기 칼날 지레 고드름 방울 얼음 고래 물고기 분수 고무총 탄성 고무 막대기 고슴도치 쥐 바늘 고양이 사람 호랑이 곡괭이 산 도구 곤충 지렁이 흙 골렘 생명 돌 곰 동굴 동물의 발톱 곰팡이 이끼 버섯 공 공기 탄성 고무 공기 공룡 ..

문제 링크: https://leetcode.com/problems/house-robber/description/ 문제 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same n..

문제 링크: https://leetcode.com/problems/climbing-stairs/description/ 문제 You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 조건 1

문제 링크: https://leetcode.com/problems/leaf-similar-trees/description/ 문제 Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence. For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8). Two binary trees are considered leaf-similar if their leaf value sequence is the same. Return true if and only if the two..

문제 링크: https://leetcode.com/problems/middle-of-the-linked-list/ 문제 Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. 조건 The number of nodes in the list is in the range [1, 100]. 1 0: head = head.next half -= 1 return head

문제 링크: https://leetcode.com/problems/determine-if-string-halves-are-alike/ 문제 You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half. Two strings are alike if they have the same number of vowels ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'). Notice that s contains uppercase and lowercase letters. Retu..

문제 링크: https://leetcode.com/problems/unique-number-of-occurrences/ 문제 Given an array of integers arr, return true if the number of occurrences of each value in the array is unique, or false otherwise. 조건 1

문제 링크: https://leetcode.com/problems/find-players-with-zero-or-one-losses/ 문제 You are given an integer array matches where matches[i] = [$winner_i, loser_i$] indicates that the player $winner_i$ defeated player $loser_i$ in a match. Return a list answer of size 2 where: answer[0] is a list of all players that have not lost any matches. answer[1] is a list of all players that have lost exactly on..