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
- 이진트리
- Python
- Binary
- HashTable
- string
- matrix
- tree
- 리트코드
- binary tree
- binary search
- 재귀
- Medium
- 미디움
- Depth-first Search
- recursive
- linked list
- sorting
- 중간
- Array
- easy
- hash table
- 쉬움
- DP
- 문자열
- list
- leetcode
- backtracking
- dfs
- two pointers
- math
Archives
- Today
- Total
목록232번 (1)
부부의 코딩 성장 일기
LeetCode 232(Implement Queue using Stacks)
1. 문제 링크 https://leetcode.com/problems/implement-queue-using-stacks/ Implement Queue using Stacks - LeetCode Can you solve this real interview question? Implement Queue using Stacks - Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty). Implement t leetcode.com 2. 문제 설명 큐(Queue)는 ..
Algorithm/LeetCode
2024. 2. 14. 19:00