| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- two pointers
- binary tree
- backtracking
- matrix
- Binary
- 재귀
- 이진트리
- Depth-first Search
- 쉬움
- DP
- list
- linked list
- 중간
- recursive
- Python
- 미디움
- string
- 문자열
- hash table
- HashTable
- leetcode
- binary search
- easy
- tree
- 리트코드
- Array
- sorting
- Medium
- dfs
- math
- Today
- Total
목록in-place (5)
부부의 코딩 성장 일기
1. 문제 링크 https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/ Remove Duplicates from Sorted Array II - LeetCode Can you solve this real interview question? Remove Duplicates from Sorted Array II - Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place [https://en.wikipedia.org/wiki/In-place_algorithm] such that each unique elemen leetcode.com..
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. 문제 링크 LeetCode - The World's Leading Online Programming Learning Platform Next Permutation - LeetCode Can you solve this real interview question? Next Permutation - A permutation of an array of integers is an arrangement of its members into a sequence or linear order. * For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], leetcode.com 2. 문제 설명 주어진 수를 한 번씩 사용..
1. 문제 링크 Remove Element - LeetCode Remove Element - LeetCode Can you solve this real interview question? Remove Element - Given an integer array nums and an integer val, remove all occurrences of val in nums in-place [https://en.wikipedia.org/wiki/In-place_algorithm]. The order of the elements may be changed. Then r leetcode.com 2. 문제 설명 int가 담긴 리스트 nums와 int인 val이 주어졌을 때, nums에서 val은 모두 제외하고 남은..