블루베리의 블로그

[알고리즘] LeetCode 1931 - Painting a Grid With Three Different Colors (C++)

[문제 링크] : https://leetcode.com/problems/painting-a-grid-with-three-different-colors/description/ Painting a Grid With Three Different Colors - LeetCodeCan you solve this real interview question? Painting a Grid With Three Different Colors - You are given two integers m and n. Consider an m x n grid where each cell is initially white. You can paint each cell red, green, or blue. All cells must be..

[알고리즘] LeetCode 1948 - Delete Duplicate Folders in System (C++)

[문제 링크] : https://leetcode.com/problems/delete-duplicate-folders-in-system/submissions/2144805629/ Delete Duplicate Folders in System - LeetCodeCan you solve this real interview question? Delete Duplicate Folders in System - Due to a bug, there are many duplicate folders in a file system. You are given a 2D array paths, where paths[i] is an array representing an absolute path to the ith folder i..

[알고리즘] LeetCode 1611 - Minimum One Bit Operations to Make Integers Zero (C++)

[문제 링크] : https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/description/ Minimum One Bit Operations to Make Integers Zero - LeetCodeCan you solve this real interview question? Minimum One Bit Operations to Make Integers Zero - Given an integer n, you must transform it into 0 using the following operations any number of times: * Change the rightmost (0th) bit in the b..

[문제 링크] : https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description/ Minimum Number of Increments on Subarrays to Form a Target Array - LeetCodeCan you solve this real interview question? Minimum Number of Increments on Subarrays to Form a Target Array - You are given an integer array target. You have an integer array initial of the same size as t..

[문제 링크] : https://leetcode.com/problems/n-queens-ii/description/ N-Queens II - LeetCodeCan you solve this real interview question? N-Queens II - The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return the number of distinct solutions to the n-queensleetcode.comclass Solution {public: int answer = 0; ..

[문제 링크] : https://leetcode.com/problems/build-a-matrix-with-conditions/description/ Build a Matrix With Conditions - LeetCodeCan you solve this real interview question? Build a Matrix With Conditions - You are given a positive integer k. You are also given: * a 2D integer array rowConditions of size n where rowConditions[i] = [abovei, belowi], and * a 2D integer array colConditileetcode.com#incl..

[문제 링크] : https://leetcode.com/problems/special-binary-string/description/ Special Binary String - LeetCodeCan you solve this real interview question? Special Binary String - Special binary strings are binary strings with the following two properties: * The number of 0's is equal to the number of 1's. * Every prefix of the binary string has at least as many 1'sleetcode.com#include using namespac..

[문제 링크] : https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/description/ Number of Ways to Paint N × 3 Grid - LeetCodeCan you solve this real interview question? Number of Ways to Paint N × 3 Grid - You have a grid of size n x 3 and you want to paint each cell of the grid with exactly one of the three colors: Red, Yellow, or Green while making sure that no two adjacent cleetcode.com..

[문제 링크] : https://leetcode.com/problems/maximum-score-words-formed-by-letters/description/ Maximum Score Words Formed by Letters - LeetCodeCan you solve this real interview question? Maximum Score Words Formed by Letters - Given a list of words, list of single letters (might be repeating) and score of every character. Return the maximum score of any valid set of words formed by using theleetcod..

[문제 링크] : https://leetcode.com/problems/unique-paths-iii/description/ Unique Paths III - LeetCodeCan you solve this real interview question? Unique Paths III - You are given an m x n integer array grid where grid[i][j] could be: * 1 representing the starting square. There is exactly one starting square. * 2 representing the ending square. There is exaleetcode.com#include using namespace std;clas..