부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/combinations/ Combinations - LeetCode Can you solve this real interview question? Combinations - Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n]. You may return the answer in any order. Example 1: Input: n = 4, k = 2 Output: [[1,2],[1,3 leetcode.com 2. 문제 설명 주어진 자연수 n과 k에 대해, 1부터 n까지의 숫자 중에서 중복과 순서 없이 k..

1. 문제 링크 https://leetcode.com/problems/sort-colors/ Sort Colors - LeetCode Can you solve this real interview question? Sort Colors - Given an array nums with n objects colored red, white, or blue, sort them in-place [https://en.wikipedia.org/wiki/In-place_algorithm] so that objects of the same color are adjacent, with the colors leetcode.com 2. 문제 설명 0,1,2 세 정수로 구성된 nums라는 array가 주어졌을 때, in-plac..

1. 문제 링크 Search a 2D Matrix - LeetCode Search a 2D Matrix - LeetCode Can you solve this real interview question? Search a 2D Matrix - You are given an m x n integer matrix matrix with the following two properties: * Each row is sorted in non-decreasing order. * The first integer of each row is greater than the last integer leetcode.com 2. 문제 설명 주어진 m x n 행렬(matrix)에 대해 target이 행렬 내에 존재하는지 여부를 판단..

1. 문제 링크 https://leetcode.com/problems/set-matrix-zeroes/ Set Matrix Zeroes - LeetCode Can you solve this real interview question? Set Matrix Zeroes - Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. You must do it in place [https://en.wikipedia.org/wiki/In-place_algorithm]. Example 1: [https leetcode.com 2. 문제 설명 mxn 정수 매트릭스 matrix가 주어져있을 때, 만약 ele..

1. 문제 링크 https://leetcode.com/problems/gray-code/description/ Gray Code - LeetCode Can you solve this real interview question? Gray Code - An n-bit gray code sequence is a sequence of 2n integers where: * Every integer is in the inclusive range [0, 2n - 1], * The first integer is 0, * An integer appears no more than once in the sequence, leetcode.com 2. 문제 설명 n-bit gray code sequence는 아래 조건을 만족하..

1. 문제 링크 https://leetcode.com/problems/simplify-path/ Simplify Path - LeetCode Can you solve this real interview question? Simplify Path - Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path. In a Unix-style file sys leetcode.com 2. 문제 설명 '/'로 시작하는 절대경로 (absolute path) path라는 문자..

1. 문제 링크 Minimum Path Sum - LeetCode Minimum Path Sum - LeetCode Can you solve this real interview question? Minimum Path Sum - Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. Note: You can only move either down or rig leetcode.com 2. 문제 설명 m*n 격자에 정수가 주어져있고 가장 왼쪽 위에서 출발해서 오른쪽 또는 아래 방향으로만 이동하여 ..

1. 문제 링크 https://leetcode.com/problems/unique-paths-ii/ Unique Paths II - LeetCode Can you solve this real interview question? Unique Paths II - You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - leetcode.com 2. 문제 설명 mxn 정수 array인 grid가 주어져있고, robot이 초기..