블루베리의 블로그

[알고리즘] LeetCode 3272 - Find the Count of Good Integers (C++)

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

[알고리즘] LeetCode 1458 - Max Dot Product of Two Subsequences (C++)

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

[알고리즘] LeetCode 2350 - Shortest Impossible Sequence of Rolls (C++)

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

[문제 링크] : https://leetcode.com/problems/find-x-value-of-array-ii/description/ Find X Value of Array II - LeetCodeCan you solve this real interview question? Find X Value of Array II - You are given an array of positive integers nums and a positive integer k. You are also given a 2D array queries, where queries[i] = [indexi, valuei, starti, xi]. You are allowed to perleetcode.com#include using na..

[문제 링크] : https://leetcode.com/problems/longest-subsequence-repeated-k-times/description/ Longest Subsequence Repeated k Times - LeetCodeCan you solve this real interview question? Longest Subsequence Repeated k Times - You are given a string s of length n, and an integer k. You are tasked to find the longest subsequence repeated k times in string s. A subsequence is a string that can be deleetc..

[문제 링크] : https://leetcode.com/problems/earliest-possible-day-of-full-bloom/description/ Earliest Possible Day of Full Bloom - LeetCodeCan you solve this real interview question? Earliest Possible Day of Full Bloom - You have n flower seeds. Every seed must be planted first before it can begin to grow, then bloom. Planting a seed takes time and so does the growth of a seed. You are givenleetcode..

[문제 링크] : https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/description/ Minimum Obstacle Removal to Reach Corner - LeetCodeCan you solve this real interview question? Minimum Obstacle Removal to Reach Corner - You are given a 0-indexed 2D integer array grid of size m x n. Each cell has one of two values: * 0 represents an empty cell, * 1 represents an obstacle that may be r..