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 |
Tags
- SOLID
- Git
- react
- mongo
- GAN
- vscode
- API
- sqlite
- ML
- Three
- nodejs
- DB
- frontend
- ts
- CV
- html
- figma
- Linux
- DM
- CSS
- UI
- python
- js
- PyTorch
- postgresql
- PRISMA
- Express
- ps
- C++
- review
Archives
- Today
- Total
목록2025/04/10 (1)
아카이브
[PS] Leet | 213. 빈집 털이 II
문제You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses were broken into on the same night. G..
CS/PS
2025. 4. 10. 11:10