블루베리의 블로그

[알고리즘] LeetCode 2014 - Longest Subsequence Repeated k Times (C++)

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

[알고리즘] LeetCode 2136 - Earliest Possible Day of Full Bloom (C++)

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

[알고리즘] LeetCode 2290 - Minimum Obstacle Removal to Reach Corner (C++)

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

[문제 링크] : https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/description/ Minimum Cost to Make at Least One Valid Path in a Grid - LeetCodeCan you solve this real interview question? Minimum Cost to Make at Least One Valid Path in a Grid - Given an m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit if you are currently in thi..

[문제 링크] : https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-ii/description/ Number of Ways to Assign Edge Weights II - LeetCodeCan you solve this real interview question? Number of Ways to Assign Edge Weights II - There is an undirected tree with n nodes labeled from 1 to n, rooted at node 1. The tree is represented by a 2D integer array edges of length n - 1, where edges[i] = ..

[문제 링크] : https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete/description/ The Earliest and Latest Rounds Where Players Compete - LeetCodeCan you solve this real interview question? The Earliest and Latest Rounds Where Players Compete - There is a tournament where n players are participating. The players are standing in a single row and are numbered from 1 to n bas..

[문제 링크] : https://leetcode.com/problems/put-marbles-in-bags/description/ Put Marbles in Bags - LeetCodeCan you solve this real interview question? Put Marbles in Bags - You have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight of the ith marble. You are also given the integer k. Divide the marbles into the k bags accordleetcode.com#include using namespace st..

[문제 링크] : https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers/description/ Minimum Distance to Type a Word Using Two Fingers - LeetCodeCan you solve this real interview question? Minimum Distance to Type a Word Using Two Fingers - [https://assets.leetcode.com/uploads/2026/06/04/image.png] You have a keyboard layout as shown above in the X-Y plane, where each English u..

[문제 링크] : https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/description/ Maximize the Number of Target Nodes After Connecting Trees II - LeetCodeCan you solve this real interview question? Maximize the Number of Target Nodes After Connecting Trees II - There exist two undirected trees with n and m nodes, labeled from [0, n - 1] and [0, m - 1], respective..

[문제 링크] : https://leetcode.com/problems/cherry-pickup-ii/description/ Cherry Pickup II - LeetCodeCan you solve this real interview question? Cherry Pickup II - You are given a rows x cols matrix grid representing a field of cherries where grid[i][j] represents the number of cherries that you can collect from the (i, j) cell. You have two robots that cleetcode.com#include using namespace std;clas..