블루베리의 블로그

[알고리즘] LeetCode 3841 - Palindromic Path Queries in a Tree (C++)

[문제 링크] : https://leetcode.com/problems/palindromic-path-queries-in-a-tree/submissions/2196684785/ Palindromic Path Queries in a Tree - LeetCodeCan you solve this real interview question? Palindromic Path Queries in a Tree - You are given an undirected tree with n nodes labeled 0 to n - 1. This is represented by a 2D array edges of length n - 1, where edges[i] = [ui, vi] indicates an undirected ..

[알고리즘] LeetCode 2897 - Apply Operations on Array to Maximize Sum of Squares (C++)

[문제 링크] : https://leetcode.com/problems/apply-operations-on-array-to-maximize-sum-of-squares/description/ Apply Operations on Array to Maximize Sum of Squares - LeetCodeCan you solve this real interview question? Apply Operations on Array to Maximize Sum of Squares - You are given a 0-indexed integer array nums and a positive integer k. You can do the following operation on the array any number ..

[알고리즘] LeetCode 1420 - Build Array Where You Can Find The Maximum Exactly K Comparisons (C++)

[문제 링크] : https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/description/ Build Array Where You Can Find The Maximum Exactly K Comparisons - LeetCodeCan you solve this real interview question? Build Array Where You Can Find The Maximum Exactly K Comparisons - You are given three integers n, m and k. Consider the following algorithm to find the maximum ..

[문제 링크] : https://leetcode.com/problems/stone-game-iv/description/ Stone Game IV - LeetCodeCan you solve this real interview question? Stone Game IV - Alice and Bob take turns playing a game, with Alice starting first. Initially, there are n stones in a pile. On each player's turn, that player makes a move consisting of removing any non-zero squleetcode.com#include using namespace std;class Solu..

[문제 링크] : https://leetcode.com/problems/count-good-triplets-in-an-array/description/ Count Good Triplets in an Array - LeetCodeCan you solve this real interview question? Count Good Triplets in an Array - You are given two 0-indexed arrays nums1 and nums2 of length n, both of which are permutations of [0, 1, ..., n - 1]. A good triplet is a set of 3 distinct values which are preseleetcode.com#in..

[문제 링크] : https://leetcode.com/problems/longest-substring-of-one-repeating-character/description/ Longest Substring of One Repeating Character - LeetCodeCan you solve this real interview question? Longest Substring of One Repeating Character - You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndice..

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

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

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