| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- LeetCode
- two-pointer
- SQL
- nlp
- gcp
- slidingwindow
- 자연어처리
- GenAI
- 릿코드
- GenerativeAI
- 투포인터
- codeup
- 리트코드
- 니트코드
- 파이썬
- 알고리즘
- Microsoft
- 파이썬기초100제
- 코드업
- 파이썬알고리즘
- tree
- Python3
- 생성형AI
- stratascratch
- medium
- sql코테
- 슬라이딩윈도우
- Python
- dfs
- heap
Archives
- Today
- Total
목록2025/04/09 (1)
Tech for good
[Leetcode/Heap] 1642. Furthest Building You Can Reach
🌷 Looking into Example -> Key is to return the furthest building indexExample 1:heights = [4, 2, 7, 6, 9, 14, 12], bricks = 5, ladders = 14 -> 2 (X)2 -> 7 (5) (Ladder)7 -> 6 (X)6 -> 9 (3) (Bricks 3)9 -> 14 (5) (Bricks 2; shortage of bricks)14 -> 12 (X)Thus, you can move by [4, 2, 7, 6, 9](Index) 0 1 2 3 4Example 2:heights = [4, 12, 2, 7, 3, 18, 20, 3, 19], bric..
IT/Computer Science
2025. 4. 9. 23:04