일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- 릿코드 파이썬
- 알고리즘풀이
- python sorted
- 릿코드풀기
- 릿코드 풀기
- LeetCode
- 파이썬 프로그래머스
- 코틀린기초
- 파이썬알고리즘
- 릿코드
- 파이썬 알고리즘
- 파이썬 알고리즘 풀기
- 알고리즘풀기
- leetcode풀이
- 파이썬릿코드
- leetcode 풀기
- 파이썬 릿코드
- python xor
- python priority queue
- 상가수익률계산기
- 파이썬릿코드풀기
- 파이썬알고리즘풀기
- leetcode풀기
- 잇츠디모
- python zip_longest
- 릿코드풀이
- python 릿코드
- python 알고리즘
- python Leetcode
- binary search
- Today
- Total
목록python Leetcode (53)
소프트웨어에 대한 모든 것
1325. Delete Leaves With a Given Value https://leetcode.com/problems/delete-leaves-with-a-given-value/ Delete Leaves With a Given Value - 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) Simple 재귀 이진 트리의 순회, 후위 순회에 대해서 이해하고 있다면 쉽게 풀 수 있는 문제입니다. # Definition for a binary tr..
1829. Maximum XOR for Each Query https://leetcode.com/problems/maximum-xor-for-each-query/ Maximum XOR for Each Query - 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) XOR 교환 법칙, 결합 법칙 XOR의 교환 법칙, 결합 법칙의 특성을 알고 있다면 쉽게 풀 수 있는 문제입니다. class Solution: def getMaximumXor(self, ..
1347. Minimum Number of Steps to Make Two Strings Anagram https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/ Minimum Number of Steps to Make Two Strings Anagram - 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) dict 자료구조 사용 class Solution: ..
1079. Letter Tile Possibilities https://leetcode.com/problems/letter-tile-possibilities/ Letter Tile Possibilities - 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) - Recursive class Solution: def numTilePossibilities(self, tiles): res = set() def recur(tiles, path): if p..
1742. Maximum Number of Balls in a Box https://leetcode.com/problems/maximum-number-of-balls-in-a-box/ Maximum Number of Balls in a Box - 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 countBalls(self, lowLimit: int, highLimit: int) -> int: d = def..
2053. Kth Distinct String in an Array https://leetcode.com/problems/kth-distinct-string-in-an-array/ Kth Distinct String in an 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) dict 사용 class Solution: def kthDistinct(self, arr: List[str], k: int) -> str: d = {} for ..
1304. Find N Unique Integers Sum up to Zero https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/ Find N Unique Integers Sum up 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) Straight forward n 숫자가 주어지면 유니크한 숫자 n개를 더했을 때 0를 만드는 array를 구하는 문제입니다. ..
1551. Minimum Operations to Make Array Equal https://leetcode.com/problems/minimum-operations-to-make-array-equal/ Minimum Operations to Make Array Equal - 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) - Straight Forward mid를 구하고 arr의 길이가 짝수인 경우와 홀수인 경우를 나눠서 생각하며 쉽게 풀립니..