목록Algorithm/LeetCode (27)

MakerHyeon

[LeetCode] 76. Minimum Window Substring

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 안..
Algorithm/LeetCode 2023. 4. 30. 18:14
[LeetCode] 567. Permutation in String

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 크기만큼 ..
Algorithm/LeetCode 2023. 4. 28. 19:33
[LeetCode] 424. Longest Repeating Character Replacement

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..
Algorithm/LeetCode 2023. 4. 27. 12:47
[LeetCode] 3. Longest Substring Without Repeating Characters

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
Algorithm/LeetCode 2023. 4. 25. 11:35
[LeetCode] 121. Best Time to Buy and Sell Stock

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 주식처럼생각하자.최..
Algorithm/LeetCode 2023. 4. 19. 14:15
[LeetCode] 42. Trapping Rain Water (python)

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 투포인터를 이용한다는 건 알겠는데, 구현을 생각해내는게 어려운문제...
Algorithm/LeetCode 2023. 4. 10. 18:42
[LeetCode] 11. Container With Most Water (python)

https://leetcode.com/problems/container-with-most-water/description/ Container With Most Water - LeetCode Can you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that toget leetcode.com 해당문제는 bruteforce로 풀면 n..
Algorithm/LeetCode 2023. 4. 6. 18:08
[LeetCode] 15. 3Sum (python,C++)

https://leetcode.com/problems/3sum/description/ 3Sum - LeetCode Can you solve this real interview question? 3Sum - Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain du leetcode.com 합이 0 인 세 숫자의 인덱스를 구하는 문제이다. 이전에 풀었던 SumII 문제와 유사하다. brute force를..
Algorithm/LeetCode 2023. 3. 14. 18:33
이전 Prev 1 2 3 4 Next 다음