162. Find Peak Element 문제 A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. You must write an algorithm that runs in O(log n) time. 제한사항 1

75. Sort Colors 문제 Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue. We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively. You must solve this problem without using the library's sort function. sort() 라이브러리를 사용하지 않고 in-place..

3. Longest Substring Without Repeating Characters 문제 Given a string s, find the length of the longest substring without repeating characters. 제한사항 0 int: max_length, start = 0, 0 checked = {} for end in range(len(s)): if s[end] not in checked: # 처음 나온 문자일 때 max_length = max(max_length, end - start + 1) else: # 반복된 문자일 때 if checked[s[end]] < start: # 반복된 문자열이 현재 window에 포함되지 않을 경우 max_length = ma..

209. Minimum Size Subarray Sum 문제 Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, ..., numsr-1, numsr] of which the sum is greater than or equal to target. If there is no such subarray, return 0 instead. 제한사항 1