부부의 코딩 성장 일기

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. 문제 링크 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/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에 위치..

1. 문제 링크 https://leetcode.com/problems/maximum-subarray/ Maximum Subarray - LeetCode Can you solve this real interview question? Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1] has t leetcode.com 2. 문제 설명 정수로 구성된 array가 주어졌을 때, element의 합이 가장..

1. 문제 링크 Pow(x, n) - LeetCode - LeetCode Can you solve this real interview question? - Implement pow(x, n) [http://www.cplusplus.com/reference/valarray/pow/], which calculates x raised to the power n (i.e., xn). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 Example 2: Input: x = 2.1 leetcode.com 2. 문제 설명 x와 n이 주어지면 x의 n제곱을 반환하기 3. 처음 풀이 그냥 x**n 하면 되는데 그게 출제 의도는 아닌 것 같다. x가 0이나 1이면 그대로..

1. 문제 링크 https://leetcode.com/problems/group-anagrams/ Group Anagrams - LeetCode Can you solve this real interview question? Group Anagrams - Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase leetcode.com 2. 문제 설명 문자열로 구성된 array strs가 주어졌을 때, anagrams로..

1. 문제 링크 Rotate Image - LeetCode Rotate Image - LeetCode Can you solve this real interview question? Rotate Image - You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place [https://en.wikipedia.org/wiki/In-place_algorithm], which m leetcode.com 2. 문제 설명 주어진 행렬을 시계방향으로 90도 회전하는 것 그런데 제자리 알고리즘(in-place)으로 해결해야한다. 새로운..