분류 전체보기

    [LeetCode]Set Matrix Zeroes

    https://leetcode.com/problems/set-matrix-zeroes/description/ 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 문제 분석 m*n matrix에서 0을 만날 때 해당 위치가 들어간 row..

    [LeetCode]Minimum Path Sum

    https://leetcode.com/problems/minimum-path-sum/ 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 문제 분석 주어진 m*n grid에서 오른쪽 or 아래로만 이동할 수 있습니다. 가장 왼쪽 위..

    [LeetCode]Jump Game

    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 문제 분석 nums 배열이 주어졌을 때 마지막 index에 도달할 수 있는지를 구하는 문제입니다. 처음 시도한 답안 c..

    [LeetCode]Spiral Matrix II

    https://leetcode.com/problems/spiral-matrix-ii/ Spiral Matrix II - LeetCode Can you solve this real interview question? Spiral Matrix II - Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order. Example 1: [https://assets.leetcode.com/uploads/2020/11/13/spiraln.jpg] Input: n = 3 O leetcode.com 문제 분석 n의 값이 주어지는 n*n matrix에서 Sprial 순서대로 탐색을 했을 경우의 ma..

    [LeetCode]Spiral Matrix

    https://leetcode.com/problems/spiral-matrix/ Spiral Matrix - LeetCode Can you solve this real interview question? Spiral Matrix - Given an m x n matrix, return all elements of the matrix in spiral order. Example 1: [https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg] Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Outpu leetcode.com 문제 분석 주어진 Grid를 시계 방향으로 달팽이 회전하듯이 탐색할 때 그 경로를 기록하는 문제입니다. 처음 ..

    [LeetCode]Maximum Subarray

    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 문제 분석 주어진 nums 리스트에서 숫자들의 합이 최대가 되는 subarray를 구하는 문제입니다..

    [LeetCode]Group Anagrams

    https://leetcode.com/problems/group-anagrams/description/ 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 문제 분석 주어진 문자열에서 동일한 anagram을 그룹화 하는 문제입니다. 처..

    [LeetCode]Rotate Image

    https://leetcode.com/problems/rotate-image/ 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 문제 분석 주어진 이미지를 90도 시계방향으로 돌리는 경우 숫자가 어떻게 변해있는지를 구하는 문제입니다. 처..

    [LeetCode]Permutations

    https://leetcode.com/problems/permutations/ Permutations - LeetCode Can you solve this real interview question? Permutations - Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Example 1: Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1], leetcode.com 문제 분석 주어진 숫자로 만들 수 있는 모든 순열을 구하는 문제입니다. 처음 시도한 답안 import iterto..

    [LeetCode]Jump Game II

    https://leetcode.com/problems/jump-game-ii/description/ Jump Game II - LeetCode Can you solve this real interview question? Jump Game II - You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. In other wo leetcode.com 문제 분석 nums 리스트에는 한번에 점프할 수 있는 최대의 값이 들어 있습니다. 목적..