| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 문자열
- 리트코드
- dfs
- Python
- hash table
- Binary
- Depth-first Search
- string
- Array
- leetcode
- backtracking
- HashTable
- matrix
- recursive
- 미디움
- DP
- math
- sorting
- 중간
- tree
- list
- easy
- binary tree
- 이진트리
- binary search
- 재귀
- 쉬움
- linked list
- two pointers
- Medium
- Today
- Total
목록queue (3)
부부의 코딩 성장 일기
1. 문제 링크 https://leetcode.com/problems/binary-tree-level-order-traversal/ - LeetCode Can you solve this real interview question? - 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. 문제 설명 이진 트리의 각 레벨마다 노드 값을 모두 담은 리스트를 반환하는 것 예시) 아래 트리가 주어지면 [[3],[9,20],[15,7]]를 반환 3 / \ 9 20 / \ 15 7 3. 처음..
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)는 ..
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..