MakerHyeon

https://leetcode.com/problems/minimum-window-substring/ Minimum Window Substring - LeetCode Can you solve this real interview question? Minimum Window Substring - Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If t leetcode.com t의 문자들이 속해있는 가장 최소 문자열을 찾는 문제이다. t 안..

https://leetcode.com/problems/permutation-in-string/ Permutation in String - LeetCode Can you solve this real interview question? Permutation in String - Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. In other words, return true if one of s1's permutations is the substring of s2. Example leetcode.com matches 변수를 하나 둠으로써 깔끔하게 처리할 수 있는 문제. s1 크기만큼 ..

https://leetcode.com/problems/longest-repeating-character-replacement/description/ Longest Repeating Character Replacement - LeetCode Can you solve this real interview question? Longest Repeating Character Replacement - You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operati leetcod..

https://leetcode.com/problems/longest-substring-without-repeating-characters/ int: charSet = set() l = 0 res = 0 for r in range(len(s)): while s[r] in charSet: charSet.remove(s[l]) l+=1 charSet.add(s[r]) res = max(res,r - l + 1) return res

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5P0-h6Ak4DFAUq SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com 패딩을 쳐줌으로써 인덱스 & 범위설정을 간단하게 만들 수 있다! SOLUTION CODE # PYTHON T = int(input()) for test_case in range(1,T + 1): N = int(input()) arr = [[0]*(N+1) for _ in range(N+1)] arr[1][1] = 1 for i in range(2,N+1): for j in range(1,i+1): ..

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PzOCKAigDFAUq SW Expert Academy SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요! swexpertacademy.com 범위설정에 주의하자.시작좌표를 기준점삼아 순회한다. SOLUTION CODE # PYTHON T = int(input()) for test_case in range(1, T + 1): N, M = map(int, input().split()) arr = [list(map (int, input().split())) for _ in range(N)] ans = 0 for si in range(N-M+1..

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/ Best Time to Buy and Sell Stock - LeetCode Can you solve this real interview question? Best Time to Buy and Sell Stock - You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosin leetcode.com 주식처럼생각하자.최..

https://leetcode.com/problems/trapping-rain-water/description/ Trapping Rain Water - LeetCode Can you solve this real interview question? Trapping Rain Water - Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: [https://assets.leetcode.com/upl leetcode.com 투포인터를 이용한다는 건 알겠는데, 구현을 생각해내는게 어려운문제...