넘치게 채우기

https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/description/?envType=daily-question&envId=2025-10-17leetcode - Maximize the number of partitions after operations문제 유형: 누적 합, 비트마스킹문제 난이도: Hard 문제You are given a string s and an integer k.First, you are allowed to change at most one index in s to another lowercase English letter.After that, do the following partitio..

https://leetcode.com/problems/find-the-minimum-amount-of-time-to-brew-potions/description/?envType=daily-question&envId=2025-10-09Leetcode - Find the Minimum Amount of Time to Brew Potions문제 유형: 다이나믹 프로그래밍문제 난이도: Medium 문제You are given two integer arrays, skill and mana, of length n and m, respectively.In a laboratory, n wizards must brew m potions in order. Each potion has a mana capacity mana[..

https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/description/?envType=daily-question&envId=2025-06-17leetcode - Count the Number of Arrays with K Matching Adjacent Elemetns문제 유형: 조합론, 수학문제 난이도: Hard 문제You are given three integers n, m, k. A good array arr of size n is defined as follows:Each element in arr is in the inclusive range [1, m].Exactly k indic..

https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-ii/description/?envType=daily-question&envId=2025-06-11leetcode - Maximum Difference Between Even and Odd Frequency II문제 유형: 비트마스크, 브루트 포스, 누적합, 슬라이딩 윈도우문제 난이도: Hard 문제You are given a string s and an integer k. Your task is to find the maximum difference between the frequency of two characters, freq[a] - freq[b], in ..

https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/description/?envType=daily-question&envId=2025-05-29leetcode - Maximize the Number of Target Nodes After Connecting Trees II문제 유형: bfs, dfs, 이분 그래프, 그래프, 코드문제 난이도: Hard 문제There exist two undirected trees with n and m nodes, labeled from [0, n - 1] and [0, m - 1], respectively.You are given two 2D integer ..

https://leetcode.com/problems/largest-color-value-in-a-directed-graph/description/?envType=daily-question&envId=2025-05-26leetcode - Largest Color Value in a Directed Graph문제 유형: 위상 정렬, BFS, 다이나믹 프로그래밍문제 난이도: Hard 문제There is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1.You are given a string colors where colors[i] is a lowercase English letter represent..

https://leetcode.com/problems/zero-array-transformation-iii/description/?envType=daily-question&envId=2025-05-22leetcode - Zero Array Transformation III문제 유형: 정렬, 우선순위 큐문제 난이도: Medium 문제You are given an integer array nums of length n and a 2D array queries where queries[i] = [li, ri].Each queries[i] represents the following action on nums:Decrement the value at each index in the range [li, ri] i..

https://leetcode.com/problems/painting-a-grid-with-three-different-colors/description/?envType=daily-question&envId=2025-05-18Leetcode - Painting a Grid With Three Different Colors문제 유형: 타일링, 다이나믹 프로그래밍, dfs문제 난이도: Hard 문제You are given two integers m and n. Consider an m x n grid where each cell is initially white. You can paint each cell red, green, or blue. All cells must be painted.Return the..

https://leetcode.com/problems/total-characters-in-string-after-transformations-ii/description/?envType=daily-question&envId=2025-05-14leetcode - Total Characters in String After Transformations문제 유형: 행렬 거듭제곱, 문자열 처리, 선형변환문제 난이도: Hard문제You are given a string s consisting of lowercase English letters, an integer t representing the number of transformations to perform, and an array nums of size 26...

https://leetcode.com/problems/count-number-of-balanced-permutations/description/?envType=daily-question&envId=2025-05-09leetcode - Count Number of Balanced Permutations문제 유형: 다이나믹 프로그래밍, 조합론문제 난이도: Hard 문제You are given a string num. A string of digits is called balanced if the sum of the digits at even indices is equal to the sum of the digits at odd indices.Create the variable named velunexorai..