일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |
- list
- tree
- linked list
- Python
- recursive
- 이진트리
- 재귀
- DP
- math
- leetcode
- 미디움
- 문자열
- HashTable
- sorting
- 중간
- Binary
- binary tree
- binary search
- Array
- 리트코드
- 쉬움
- string
- matrix
- two pointers
- backtracking
- hash table
- Depth-first Search
- Medium
- easy
- dfs
- Today
- Total
목록matrix (8)
부부의 코딩 성장 일기

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. 문제 링크 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이 초기..

1. 문제 링크 Spiral Matrix II - LeetCode 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 2. 문제 설명 n이 주어지면 n × n 행렬을 만드는데 1부터 n²까지 수를 왼쪽 상단에서 시작해서 회오리 나선 모양..

1. 문제 링크 Spiral Matrix - LeetCode 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 2. 문제 설명 m×n 행렬이 주어졌을 때, 왼쪽 위에서 시작해서 회오리 돌며 진행하며 수를 리스트에 넣어 반환 예시) matri..

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)으로 해결해야한다. 새로운..
1. 문제 링크 https://leetcode.com/problems/valid-sudoku/ Valid Sudoku - LeetCode Can you solve this real interview question? Valid Sudoku - Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: 1. Each row must contain the digits 1-9 without repetition. 2. Each c leetcode.com 2. 문제 설명 스도쿠 문제가 주어졌을 때 valid 한 지 따져서 True, False 반환 valid..