블루베리의 블로그

[알고리즘] LeetCode 3989 - Maximum Consistent Columns in a Grid (C++)

[문제 링크] : https://leetcode.com/problems/maximum-consistent-columns-in-a-grid/description/ Maximum Consistent Columns in a Grid - LeetCodeCan you solve this real interview question? Maximum Consistent Columns in a Grid - You are given a 2D integer array grid of size m x n, and an integer limit. You may remove zero or more columns from the grid, but at least one column must remain. The relatileetc..

[알고리즘] LeetCode 1970 - Last Day Where You Can Still Cross (C++)

[문제 링크] : https://leetcode.com/problems/last-day-where-you-can-still-cross/description/ Last Day Where You Can Still Cross - LeetCodeCan you solve this real interview question? Last Day Where You Can Still Cross - There is a 1-based binary matrix where 0 represents land and 1 represents water. You are given integers row and col representing the number of rows and columns in the matrix,leetcode.c..

[알고리즘] LeetCode 3068 - Find the Maximum Sum of Node Values (C++)

[문제 링크] : https://leetcode.com/problems/find-the-maximum-sum-of-node-values/description/ Find the Maximum Sum of Node Values - LeetCodeCan you solve this real interview question? Find the Maximum Sum of Node Values - There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 0-indexed 2D integer array edges of length n - 1, where edges[i] = [ui, vi] indicates that tleetcod..

[문제 링크] : https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description/ Count Subarrays With Fixed Bounds - LeetCodeCan you solve this real interview question? Count Subarrays With Fixed Bounds - You are given an integer array nums and two integers minK and maxK. A fixed-bound subarray of nums is a subarray that satisfies the following conditions: * The minimum value inleetcode.co..

[문제 링크] : https://leetcode.com/problems/find-the-count-of-good-integers/description/ Find the Count of Good Integers - LeetCodeCan you solve this real interview question? Find the Count of Good Integers - You are given two positive integers n and k. An integer x is called k-palindromic if: * x is a palindrome. * x is divisible by k. An integer is called good if its digits can be rleetcode.com#in..

[문제 링크] : https://leetcode.com/problems/max-dot-product-of-two-subsequences/description/#include using namespace std;class Solution {public: int maxDotProduct(vector& nums1, vector& nums2) { int n = nums1.size(); int m = nums2.size(); vector> dp(n + 1, vector(m + 1, INT_MIN / 2)); for(int i = 1; i

[문제 링크] : https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/description/ Shortest Impossible Sequence of Rolls - LeetCodeCan you solve this real interview question? Shortest Impossible Sequence of Rolls - You are given an integer array rolls of length n and an integer k. You roll a k sided dice numbered from 1 to k, n times, where the result of the ith roll is rolls[i]. Retulee..

[문제 링크] : https://leetcode.com/problems/minimum-difference-in-sums-after-removal-of-elements/description/ Minimum Difference in Sums After Removal of Elements - LeetCodeCan you solve this real interview question? Minimum Difference in Sums After Removal of Elements - You are given a 0-indexed integer array nums consisting of 3 * n elements. You are allowed to remove any subsequence of elements o..

[문제 링크] : https://leetcode.com/problems/parsing-a-boolean-expression/submissions/2169356391/ Parsing A Boolean Expression - LeetCodeCan you solve this real interview question? Parsing A Boolean Expression - A boolean expression is an expression that evaluates to either true or false. It can be in one of the following shapes: * 't' that evaluates to true. * 'f' that evaluates to false.leetcode.co..

[문제 링크] : https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/description/ Remove Max Number of Edges to Keep Graph Fully Traversable - LeetCodeCan you solve this real interview question? Remove Max Number of Edges to Keep Graph Fully Traversable - Alice and Bob have an undirected graph of n nodes and three types of edges: * Type 1: Can be traversed by Alice ..