블루베리의 블로그

[알고리즘] LeetCode 1106 - Parsing A Boolean Expression (C++)

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

[알고리즘] LeetCode 1579 - Remove Max Number of Edges to Keep Graph Fully Traversable (C++)

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

[알고리즘] LeetCode 3525 - Find X Value of Array II (C++)

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

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