블루베리의 블로그

[알고리즘] LeetCode 2493 - Divide Nodes Into the Maximum Number of Groups (C++)

[문제 링크] : 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..

[알고리즘] LeetCode 2050 - Parallel Courses III (C++)

[문제 링크] : https://leetcode.com/problems/parallel-courses-iii/description/ Parallel Courses III - LeetCodeCan 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] denleetcode.com#include using namespace ..

[알고리즘] LeetCode 2097 - Valid Arrangement of Pairs (C++)

[문제 링크] : https://leetcode.com/problems/valid-arrangement-of-pairs/description/ Valid Arrangement of Pairs - LeetCodeCan you solve this real interview question? Valid Arrangement of Pairs - You are given a 0-indexed 2D integer array pairs where pairs[i] = [starti, endi]. An arrangement of pairs is valid if for every index i where 1 leetcode.com#include using namespace std;class Solution {public:..

[문제 링크] : https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/description/ Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree - LeetCodeCan you solve this real interview question? Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree - Given a weighted undirected connected graph with n vertices numbered from 0 to n - 1, and an a..

[문제 링크] : https://leetcode.com/problems/count-fertile-pyramids-in-a-land/description/ Count Fertile Pyramids in a Land - LeetCodeCan you solve this real interview question? Count Fertile Pyramids in a Land - A farmer has a rectangular grid of land with m rows and n columns that can be divided into unit cells. Each cell is either fertile (represented by a 1) or barren (represented byleetcode.com#..

[문제 링크] : https://leetcode.com/problems/maximum-building-height/description/ Maximum Building Height - LeetCodeCan you solve this real interview question? Maximum Building Height - You want to build n new buildings in a city. The new buildings will be built in a line and are labeled from 1 to n. However, there are city restrictions on the heights of the new buildinleetcode.com#include using name..

[문제 링크] : https://leetcode.com/problems/brace-expansion-ii/description/ Brace Expansion II - LeetCodeCan you solve this real interview question? Brace Expansion II - Under the grammar given below, strings can represent a set of lowercase words. Let R(expr) denote the set of words the expression represents. The grammar can best be understood through simpleetcode.com#include using namespace std;cl..

[문제 링크] : https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/description/ Maximum Candies You Can Get from Boxes - LeetCodeCan you solve this real interview question? Maximum Candies You Can Get from Boxes - You have n boxes labeled from 0 to n - 1. You are given four arrays: status, candies, keys, and containedBoxes where: * status[i] is 1 if the ith box is open and 0 if thele..

[문제 링크] : https://leetcode.com/problems/number-of-zigzag-arrays-ii/description/ Number of ZigZag Arrays II - LeetCodeCan you solve this real interview question? Number of ZigZag Arrays II - You are given three integers n, l, and r. A ZigZag array of length n is defined as follows: * Each element lies in the range [l, r]. * No two adjacent elements are equal. * No three cleetcode.com#include usin..

[문제 링크] : https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities/description/ Count Subtrees With Max Distance Between Cities - LeetCodeCan you solve this real interview question? Count Subtrees With Max Distance Between Cities - There are n cities numbered from 1 to n. You are given an array edges of size n-1, where edges[i] = [ui, vi] represents a bidirectional edge betw..