일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- math
- Binary
- string
- Medium
- sorting
- 미디움
- Depth-first Search
- 리트코드
- 이진트리
- HashTable
- Array
- dfs
- binary tree
- tree
- hash table
- linked list
- 쉬움
- list
- backtracking
- recursive
- Python
- easy
- 중간
- 문자열
- binary search
- 재귀
- DP
- two pointers
- matrix
- leetcode
- Today
- Total
목록Array (32)
부부의 코딩 성장 일기
1. 문제 링크 https://leetcode.com/problems/permutations-ii Permutations II - LeetCode Can you solve this real interview question? Permutations II - Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Example 1: Input: nums = [1,1,2] Output: [[1,1,2], [1,2,1], [2,1,1]] leetcode.com 2. 문제 설명 이전 46. Permutations와 유사하게, nums라는 array가 ..
1. 문제 링크 https://leetcode.com/problems/jump-game-ii/ 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 2. 문제 설명 길이가 n인 정수로 구성된 array인 nums가 주어졌을 때, nums[i..
1. 문제 링크 https://leetcode.com/problems/combination-sum-ii/ Combination Sum II - LeetCode Can you solve this real interview question? Combination Sum II - Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target. Each number in candid leetcode.com 2. 문제 설명 기존 Combination Sum(Leetcode39)의..
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..
1. 문제 링크 https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/ Find First and Last Position of Element in Sorted Array - LeetCode Can you solve this real interview question? Find First and Last Position of Element in Sorted Array - Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target v..
1. 문제 링크 https://leetcode.com/problems/search-in-rotated-sorted-array/ Search in Rotated Sorted Array - LeetCode Can you solve this real interview question? Search in Rotated Sorted Array - There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 int: # 회전된 배열에서 pivot(회전의 기준이 되..
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. 문제 링크 https://leetcode.com/problems/4sum/description/ 4Sum - LeetCode Can you solve this real interview question? 4Sum - Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: * 0 List[List[int]]: nums.sort() output = [] for i in range(len(nums)-3): if i > 0 and nums[i] == nums[i - 1]: continue # 중복된 값을 건너뛰기 for j in ra..