부부의 코딩 성장 일기

1. 문제 링크 Word Search - LeetCode Word Search - LeetCode Can you solve this real interview question? Word Search - Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are h leetcode.com 2. 문제 설명 board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]] ..

1. 문제 링크 https://leetcode.com/problems/edit-distance/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 두 개의 문자열(word1과 word2)이 주어졌을 때, 한 문자열을 다른 문자열로 변환하기 위해 필요한 최소 편집 연산의 수를 찾는 문제 가능한 연산은 세 가지로 삽입(Insert): 한 문자를 삽입..

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/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/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이 초기..

1. 문제 링크 https://leetcode.com/problems/rotate-list/ Rotate List - LeetCode Can you solve this real interview question? Rotate List - Given the head of a linked list, rotate the list to the right by k places. Example 1: [https://assets.leetcode.com/uploads/2020/11/13/rotate1.jpg] Input: head = [1,2,3,4,5], k = 2 Output: [4,5,1 leetcode.com 2. 문제 설명 linked list의 head가 주어졌을 때, k번 오른쪽으로 회전한 linked l..

1. 문제 링크 https://leetcode.com/problems/insert-interval/ Insert Interval - LeetCode Can you solve this real interview question? Insert Interval - You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order b leetcode.com 2. 문제 설명 주어진 배열 intervals는 시작과 끝을 나타내는 요소들을 가..

1. 문제 링크 https://leetcode.com/problems/jump-game/ Jump Game - LeetCode Can you solve this real interview question? Jump Game - You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can leetcode.com 2. 문제 설명 정수 array인 nums가 주어졌을 때, 초기에는 nums의 첫번째 array에 위치..