블루베리의 블로그

[알고리즘] LeetCode 3559 - Number of Ways to Assign Edge Weights II (C++)

[문제 링크] : https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-ii/description/ Number of Ways to Assign Edge Weights II - LeetCodeCan you solve this real interview question? Number of Ways to Assign Edge Weights II - There is an undirected tree with n nodes labeled from 1 to n, rooted at node 1. The tree is represented by a 2D integer array edges of length n - 1, where edges[i] = ..

[알고리즘] LeetCode 1900 - The Earliest and Latest Rounds Where Players Compete (C++)

[문제 링크] : https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete/description/ The Earliest and Latest Rounds Where Players Compete - LeetCodeCan you solve this real interview question? The Earliest and Latest Rounds Where Players Compete - There is a tournament where n players are participating. The players are standing in a single row and are numbered from 1 to n bas..

[알고리즘] LeetCode 2551 - Put Marbles in Bags (C++)

[문제 링크] : https://leetcode.com/problems/put-marbles-in-bags/description/ Put Marbles in Bags - LeetCodeCan you solve this real interview question? Put Marbles in Bags - You have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight of the ith marble. You are also given the integer k. Divide the marbles into the k bags accordleetcode.com#include using namespace st..

[문제 링크] : https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers/description/ Minimum Distance to Type a Word Using Two Fingers - LeetCodeCan you solve this real interview question? Minimum Distance to Type a Word Using Two Fingers - [https://assets.leetcode.com/uploads/2026/06/04/image.png] You have a keyboard layout as shown above in the X-Y plane, where each English u..

[문제 링크] : https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/description/ Maximize the Number of Target Nodes After Connecting Trees II - LeetCodeCan you solve this real interview question? Maximize the Number of Target Nodes After Connecting Trees II - There exist two undirected trees with n and m nodes, labeled from [0, n - 1] and [0, m - 1], respective..

[문제 링크] : https://leetcode.com/problems/cherry-pickup-ii/description/ Cherry Pickup II - LeetCodeCan you solve this real interview question? Cherry Pickup II - You are given a rows x cols matrix grid representing a field of cherries where grid[i][j] represents the number of cherries that you can collect from the (i, j) cell. You have two robots that cleetcode.com#include using namespace std;clas..

[문제 링크] : https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/description/ Minimum Number of Flips to Convert Binary Matrix to Zero Matrix - LeetCodeCan you solve this real interview question? Minimum Number of Flips to Convert Binary Matrix to Zero Matrix - Given a m x n binary matrix mat. In one step, you can choose one cell and flip it and all the fou..

[문제 링크] : https://leetcode.com/problems/number-of-visible-people-in-a-queue/description/ Number of Visible People in a Queue - LeetCodeCan you solve this real interview question? Number of Visible People in a Queue - There are n people standing in a queue, and they numbered from 0 to n - 1 in left to right order. You are given an array heights of distinct integers where heights[i] represeleetcod..

[문제 링크] : https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/ Maximum Number of K-Divisible Components - LeetCodeCan you solve this real interview question? Maximum Number of K-Divisible Components - There is an undirected tree with n nodes labeled from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] ..

[문제 링크] : http://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/description/#include using namespace std;class Solution {public: int minInsertions(string s) { int n = s.length(); string rev = s; reverse(rev.begin(), rev.end()); vector> dp(n + 1, vector(n + 1, 0)); for(int i = 1; i