넘치게 채우기

https://leetcode.com/problems/k-th-symbol-in-grammar/ K-th Symbol in Grammar - LeetCode Can you solve this real interview question? K-th Symbol in Grammar - We build a table of n rows (1-indexed). We start by writing 0 in the 1st row. Now in every subsequent row, we look at the previous row and replace each occurrence of 0 with 01, and each o leetcode.com leetcode - K-th Symbol in Grammar 문제 유형 ..

https://leetcode.com/problems/palindrome-number/description/ Palindrome Number - LeetCode Can you solve this real interview question? Palindrome Number - Given an integer x, return true if x is a palindrome, and false otherwise. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Ex leetcode.com leetcode - Palindrome Number 문제 유형 : 수학 /..

https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/ Find Largest Value in Each Tree Row - LeetCode Can you solve this real interview question? Find Largest Value in Each Tree Row - Given the root of a binary tree, return an array of the largest value in each row of the tree (0-indexed). Example 1: [https://assets.leetcode.com/uploads/2020/08/21/large leetcode.com leetc..

https://leetcode.com/problems/power-of-four/description/ Power of Four - LeetCode Can you solve this real interview question? Power of Four - Given an integer n, return true if it is a power of four. Otherwise, return false. An integer n is a power of four, if there exists an integer x such that n == 4x. Example 1: Input: n = 16 Outp leetcode.com LeetCode - Power of Four 문제 유형 : 수학 문제 난이도 : Easy..

https://leetcode.com/problems/maximum-score-of-a-good-subarray/description/ Maximum Score of a Good Subarray - LeetCode Can you solve this real interview question? Maximum Score of a Good Subarray - You are given an array of integers nums (0-indexed) and an integer k. The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], ..., nums[j]) * (j - i + 1). A good su leetcode.com LeetCode..

https://leetcode.com/problems/constrained-subsequence-sum/description/ Constrained Subsequence Sum - LeetCode Can you solve this real interview question? Constrained Subsequence Sum - Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] leetcode.com leetcode - Constra..

https://leetcode.com/problems/flatten-nested-list-iterator/description/ Flatten Nested List Iterator - LeetCode Can you solve this real interview question? Flatten Nested List Iterator - You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers or other lists. Implement an iterator to flatten leetcode.com 341. Flatten Nest..

https://leetcode.com/problems/backspace-string-compare/description/ Backspace String Compare - LeetCode Can you solve this real interview question? Backspace String Compare - Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character. Note that after backspacing an empty text, the tex leetcode.com [LeetCode] 844. Backspac..

https://leetcode.com/problems/parallel-courses-iii/description/ Parallel Courses III - LeetCode Can you solve this real interview question? Parallel Courses III - You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given a 2D integer array relations where relations[j] = [prevCoursej, nextCoursej] den leetcode.com 문제 유형 : 위상 정렬 문제 난이도 : Hard 문제 Y..

https://leetcode.com/problems/validate-binary-tree-nodes/description/ Validate Binary Tree Nodes - LeetCode Can you solve this real interview question? Validate Binary Tree Nodes - You have n binary tree nodes numbered from 0 to n - 1 where node i has two children leftChild[i] and rightChild[i], return true if and only if all the given nodes form exactly one val leetcode.com 문제 유형 : BFS / DFS 문제..