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
- hash table
- 이진트리
- linked list
- Medium
- HashTable
- math
- 재귀
- recursive
- 중간
- Depth-first Search
- easy
- DP
- Python
- string
- leetcode
- Binary
- binary tree
- Array
- backtracking
- 문자열
- 미디움
- binary search
- matrix
- dfs
- 리트코드
- two pointers
- list
- 쉬움
- tree
- sorting
Archives
- Today
- Total
목록Implement Stack using Queues (1)
부부의 코딩 성장 일기
LeetCode 225(Implement Stack using Queues)
1. 문제 링크 https://leetcode.com/problems/implement-stack-using-queues/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 queue를 활용하여 stack을 구현하라. 여기서 stack은 last-in-first-out (LIFO)를 의미 일반적인 stack은 push, top, pop, empt..
Algorithm/LeetCode
2024. 2. 13. 21:27