블루베리의 블로그

[알고리즘] LeetCode 3414 - Maximum Score of Non-overlapping Intervals (C++)

[문제 링크] : https://leetcode.com/problems/maximum-score-of-non-overlapping-intervals/description/ Maximum Score of Non-overlapping Intervals - LeetCodeCan you solve this real interview question? Maximum Score of Non-overlapping Intervals - You are given a 2D integer array intervals, where intervals[i] = [li, ri, weighti]. Interval i starts at position li and ends at ri, and has a weight of weighti..

[알고리즘] LeetCode 3600 - Maximize Spanning Tree Stability with Upgrades (C++)

[문제 링크] : https://leetcode.com/problems/maximize-spanning-tree-stability-with-upgrades/description/ Maximize Spanning Tree Stability with Upgrades - LeetCodeCan you solve this real interview question? Maximize Spanning Tree Stability with Upgrades - You are given an integer n, representing n nodes numbered from 0 to n - 1 and a list of edges, where edges[i] = [ui, vi, si, musti]: * ui and vi ind..

[알고리즘] LeetCode 3772 - Maximum Subgraph Score in a Tree (C++)

[문제 링크] : https://leetcode.com/problems/maximum-subgraph-score-in-a-tree/description/#include using namespace std;class Solution {public: vector maxSubgraphScore(int n, vector>& edges, vector& good) { vector> graph(n); for(auto& edge : edges) { graph[edge[0]].push_back(edge[1]); graph[edge[1]].push_back(edge[0]); } vector parent(n, -1); ..

[문제 링크] : https://leetcode.com/problems/design-graph-with-shortest-path-calculator/description/ Design Graph With Shortest Path Calculator - LeetCodeCan you solve this real interview question? Design Graph With Shortest Path Calculator - There is a directed weighted graph that consists of n nodes numbered from 0 to n - 1. The edges of the graph are initially represented by the given array edges ..

[문제 링크] : https://leetcode.com/problems/check-if-it-is-a-good-array/description/ Check If It Is a Good Array - LeetCodeCan you solve this real interview question? Check If It Is a Good Array - Given an array nums of positive integers. Your task is to select some subset of nums, multiply each element by an integer and add all these numbers. The array is said to be good leetcode.com#include using ..

[문제 링크] : https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/description/ Number of Ways to Reorder Array to Get Same BST - LeetCodeCan you solve this real interview question? Number of Ways to Reorder Array to Get Same BST - Given an array nums that represents a permutation of integers from 1 to n. We are going to construct a binary search tree (BST) by inserting the ..

[문제 링크] : https://leetcode.com/problems/minimum-edge-toggles-on-a-tree/description/ Minimum Edge Toggles on a Tree - LeetCodeCan you solve this real interview question? Minimum Edge Toggles on a Tree - You are given an undirected tree with n nodes, numbered from 0 to n - 1. It is represented by a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that thleetcode.com#incl..

[문제 링크] : https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/description/ Sort Items by Groups Respecting Dependencies - LeetCodeCan you solve this real interview question? Sort Items by Groups Respecting Dependencies - There are n items each belonging to zero or one of m groups where group[i] is the group that the i-th item belongs to and it's equal to -1 if the i-th ite..

[문제 링크] : https://leetcode.com/problems/find-the-number-of-subsequences-with-equal-gcd/description/ Find the Number of Subsequences With Equal GCD - LeetCodeCan you solve this real interview question? Find the Number of Subsequences With Equal GCD - You are given an integer array nums. Your task is to find the number of pairs of non-empty subsequences (seq1, seq2) of nums that satisfy the follow..

[문제 링크] : https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/#include using namespace std;class Solution {public: int magnificentSets(int n, vector>& edges) { vector> graph(n); for(auto& edge : edges) { int u = edge[0] - 1; int v = edge[1] - 1; graph[u].push_back(v); graph[v].push_back(u); } vect..