블루베리의 블로그

[알고리즘] LeetCode 1284 - Minimum Number of Flips to Convert Binary Matrix to Zero Matrix (C++)

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

[알고리즘] LeetCode 1944 - Number of Visible People in a Queue (C++)

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

[알고리즘] LeetCode 2872 - Maximum Number of K-Divisible Components (C++)

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

[문제 링크] : https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/description/ Number of Submatrices That Sum to Target - LeetCodeCan you solve this real interview question? Number of Submatrices That Sum to Target - Given a matrix and a target, return the number of non-empty submatrices that sum to target. A submatrix x1, y1, x2, y2 is the set of all cells matrix[x][y] with x1 le..

[문제 링크] : https://leetcode.com/problems/stone-game-viii/description/ Stone Game VIII - LeetCodeCan you solve this real interview question? Stone Game VIII - Alice and Bob take turns playing a game, with Alice starting first. There are n stones arranged in a row. On each player's turn, while the number of stones is more than one, they will do the folleetcode.com#include using namespace std;class ..

[문제 링크] : https://leetcode.com/problems/jump-game-v/description/= 0 and 0 Jump Game V - LeetCodeCan you solve this real interview question? Jump Game V - Given an array of integers arr and an integer d. In one step you can jump from index i to index: * i + x where: i + x = 0 and 0 leetcode.com#include using namespace std;class Solution {public: int n, d; vector arr; vector dp; int d..

[문제 링크] : https://leetcode.com/problems/minimum-score-after-removals-on-a-tree/description/ Minimum Score After Removals on a Tree - LeetCodeCan you solve this real interview question? Minimum Score After Removals on a Tree - There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges. You are given a 0-indexed integer array nums of length n where nums[i] represenl..

[문제 링크] : https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/description/ Minimum Initial Energy to Finish Tasks - LeetCodeCan you solve this real interview question? Minimum Initial Energy to Finish Tasks - You are given an array tasks where tasks[i] = [actuali, minimumi]: * actuali is the actual amount of energy you spend to finish the ith task. * minimumi is the minimum amol..

[문제 링크] : https://leetcode.com/problems/reducing-dishes/description/ Reducing Dishes - LeetCodeCan you solve this real interview question? Reducing Dishes - A chef has collected data on the satisfaction level of his n dishes. Chef can cook any dish in 1 unit of time. Like-time coefficient of a dish is defined as the time taken to cook that dish inclleetcode.com#include using namespace std;class ..