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
- Array
- 재귀
- matrix
- linked list
- Depth-first Search
- 이진트리
- 쉬움
- tree
- math
- 리트코드
- backtracking
- binary search
- sorting
- 중간
- easy
- two pointers
- Binary
- string
- dfs
- Python
- DP
- hash table
- Medium
- leetcode
- HashTable
- binary tree
- recursive
- list
- 미디움
- 문자열
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