Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- string
- binary tree
- Python
- Array
- tree
- binary search
- DP
- 미디움
- math
- 재귀
- dfs
- recursive
- two pointers
- Binary
- backtracking
- sorting
- leetcode
- 중간
- HashTable
- Medium
- hash table
- 이진트리
- 문자열
- list
- 리트코드
- easy
- Depth-first Search
- linked list
- 쉬움
- matrix
Archives
- Today
- Total
목록LeetCode 11 (1)
부부의 코딩 성장 일기
LeetCode 11(Container With Most Water, python)
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. 문제 설명 리트 코드..
Algorithm/LeetCode
2023. 12. 12. 19:00