| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- recursive
- 이진트리
- Depth-first Search
- sorting
- HashTable
- binary tree
- 쉬움
- Medium
- 중간
- two pointers
- 미디움
- Array
- math
- Binary
- binary search
- leetcode
- backtracking
- DP
- string
- Python
- dfs
- 리트코드
- hash table
- linked list
- tree
- list
- matrix
- 재귀
- easy
- 문자열
- Today
- Total
목록greedy (2)
부부의 코딩 성장 일기
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. 문제 링크 LeetCode - The World's Leading Online Programming Learning Platform Container With Most Water - LeetCode Can you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that toget leetcode.com 2. 문제 설명 리트 코드..