0/leetcode (21) 썸네일형 리스트형 5. Longest Palindromic Substring 1. There can be two scenarios. Odd and even number.2. Start from center and expand to left and right.3. Compare with the previous string length. 39. Combination Sum You are allowed to use same element AGAIN.1. Start from 0 index.2. You don't need to start over from 0 index again but current index.3. Make sure you copy current array [:]. DON'T pass reference. 33. Search in Rotated Sorted Array 1. Find pivot index2. Check if valid range3. Move pointers accordingly NO WHILE LOOP INSIDE! 53. Maximum Subarray 풀이 leetcode.com/problems/maximum-subarray/ Maximum Subarray - 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 # Greedy class Solution: def maxSubArray(self, nums: List[int]) -> int: if not nums : return 0 curr_max = output = nums[0] for i in range(1, len(nums)) : curr_max = max(curr_m.. 139. Word Break 풀이 leetcode.com/problems/word-break/ Word Break - 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 class Solution: def wordBreak(self, s: str, wordDict: List[str]) -> bool: if not s or not wordDict : return False words = set(wordDict) n = len(s) dp = [False]*(n+1) dp[0] = True for end .. 5. Longest Palindromic Substring 풀이 leetcode.com/problems/longest-palindromic-substring/ Longest Palindromic Substring - 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 문제 : 가장 긴 palindromic 한 문자열을 리턴하는 것. 풀이 : 첫 번째는 인덱스를 하나하나 늘려가면서 왼쪽과 오른쪽으로 expanding 해 나가는 방법이 있다. 이때 주의해야 할 점은 palindrome의 길이가 홀수인지 짝수인지 알 수 없기 때문에 두.. [October LeetCoding Challenge] 29th - Maximize Distance to Closest Person leetcode.com/explore/challenge/card/october-leetcoding-challenge/563/week-5-october-29th-october-31st/3512/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com class Solution: def maxDistToClosest(self, seats: List[int]) ->.. 398. Random Pick Index leetcode.com/problems/random-pick-index/ Random Pick Index - 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 class Solution: def __init__(self, nums: List[int]): self.nums = nums def pick(self, target: int) -> int: output = 0 count = 0 for i, x in enumerate(self.nums) : if x != tar.. 이전 1 2 3 다음