허서기의 블로그

오늘 리뷰할 문제는 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 문제 설명을 하자면..

오늘 리뷰할 문제는 65. valid number 이다. https://leetcode.com/problems/valid-number/ Valid Number - LeetCode Can you solve this real interview question? Valid Number - A valid number can be split up into these components (in order): 1. A decimal number or an integer. 2. (Optional) An 'e' or 'E', followed by an integer. A decimal number can be split up into these leetcode.com 이 문제는 문자열이, 숫자로 치환가능한지를 판별하는 ..

오늘 리뷰할 문제는 permutation sequence이다. https://leetcode.com/problems/permutation-sequence/ Permutation Sequence - LeetCode Can you solve this real interview question? Permutation Sequence - The set [1, 2, 3, ..., n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the following sequence for n = 3: 1. "123" 2. "132" 3 leetcode.com 이 문제는 1.....

오늘 리뷰할 문제는 N queens 2이다. https://leetcode.com/problems/n-queens-ii/ N-Queens II - LeetCode Can you solve this real interview question? N-Queens II - The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return the number of distinct solutions to the n-queens leetcode.com 이번 문제는 사실 지난 문제보다 쉬워졌다고 보면 되는데, 왜냐하면 지난..