허서기의 블로그

오늘 리뷰할 문제는 palindrome partitioning 2이다. https://leetcode.com/problems/palindrome-partitioning-ii/ int: def is_palindrome(string: str) -> bool: return string == string[::-1] cache = {} def solve_min_cut(i: int, j: int) -> int: key = (i, j) if key in cache: return cache[key] if is_palindrome(s[i:j]): cache[key] = 0 return 0 min_cut = j - i + 1 for index in range(i + 1, j): if is_palindrome(s[i:ind..

오늘 리뷰할 문제는 word ladder 이다. https://leetcode.com/problems/word-ladder/ Word Ladder - LeetCode Can you solve this real interview question? Word Ladder - A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: * Every adjacent pair of words differs leetcode.com 이 문제는 시작단어, 끝 단어, 그리고 단어들의 목록이 있을 때...

오늘 리뷰할 문제는 126. word ladder 3이다. https://leetcode.com/problems/word-ladder-ii/ Word Ladder II - LeetCode Can you solve this real interview question? Word Ladder II - A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: * Every adjacent pair of words diffe leetcode.com 이 문제는 시작단어, 끝 단어, 그리고 단..

오늘 리뷰할 문제는 binary tree maximm path sum입니다. https://leetcode.com/problems/binary-tree-maximum-path-sum/ Binary Tree Maximum Path Sum - LeetCode Can you solve this real interview question? Binary Tree Maximum Path Sum - A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. N..

오늘 리뷰할 문제는 best time to buy and sell stock 3이다. https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/ Best Time to Buy and Sell Stock III - LeetCode Can you solve this real interview question? Best Time to Buy and Sell Stock III - You are given an array prices where prices[i] is the price of a given stock on the ith day. Find the maximum profit you can achieve. You may complete at m..

오늘 리뷰할 문제는 distinct subsequences이다. https://leetcode.com/problems/distinct-subsequences/ Distinct Subsequences - LeetCode Can you solve this real interview question? Distinct Subsequences - Given two strings s and t, return the number of distinct subsequences of s which equals t. The test cases are generated so that the answer fits on a 32-bit signed integer. Example 1: In leetcode.com 문자열 s, t가..

오늘 리뷰할 문제는 scramble string 입니다. https://leetcode.com/problems/scramble-string/ Scramble String - LeetCode Can you solve this real interview question? Scramble String - We can scramble a string s to get a string t using the following algorithm: 1. If the length of the string is 1, stop. 2. If the length of the string is > 1, do the following: * Split the string leetcode.com 이 문제는 두개의 문자열이 들어왔을 때,..

오늘 리뷰할 문제는 85 maximum rectangle 이다. https://leetcode.com/problems/maximal-rectangle/ Maximal Rectangle - LeetCode Can you solve this real interview question? Maximal Rectangle - Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example 1: [https://assets.leetcode.com/uploads/2020/09/14/ma leetcode.com 0과 1로 이루어진 2차원 배열에..

오늘 리뷰할 문제는 78 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 leetcod..

오늘 리뷰할 문제는 68.text justification 입니다. https://leetcode.com/problems/text-justification/ Text Justification - LeetCode Can you solve this real interview question? Text Justification - Given an array of strings words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified. You should pack your words i leetcode.com 문제 설명을 하자면..