-
Notifications
You must be signed in to change notification settings - Fork 4
Home
RiverMountain edited this page Mar 20, 2025
·
7 revisions
| 문제이름 | 문제링크 |
|---|---|
| 이진 트리의 최대 깊이 | https://leetcode.com/problems/maximum-depth-of-binary-tree/ |
| 이진 트리의 중위 순회 | https://leetcode.com/problems/binary-tree-inorder-traversal/ |
| 같은 트리인지 비교 | https://leetcode.com/problems/same-tree/description/ |
| 이진 트리 반전 | https://leetcode.com/problems/invert-binary-tree/ |
| 문제이름 | 문제링크 |
|---|---|
| 이진 트리 레벨 순서 순회 | https://leetcode.com/problems/binary-tree-level-order-traversal/ |
| 이진 탐색 트리 검증 | https://leetcode.com/problems/validate-binary-search-tree/description/ |
| 전위 및 중위 순회로부터 이진트리 구축 | https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ |
| 문제이름 | 문제링크 |
|---|---|
| 이진 변환 반복하기 | https://school.programmers.co.kr/learn/courses/30/lessons/70129 |
| 이진 트리 최대 경로 합 | https://leetcode.com/problems/binary-tree-maximum-path-sum/description/ |
| 이진 트리 직렬화 및 역직렬화 | https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/ |
| 문제이름 | 문제링크 |
|---|---|
| 중복된 문자 제거 | https://school.programmers.co.kr/learn/courses/30/lessons/120888 |
| 한 번만 등장한 문자 | https://school.programmers.co.kr/learn/courses/30/lessons/120896 |
| 숫자 카드 | https://www.acmicpc.net/problem/10815 |
| 무작위로 K개의 수 뽑기 | https://school.programmers.co.kr/learn/courses/30/lessons/181858 |
| Contains Duplicate | https://leetcode.com/problems/contains-duplicate |
| Intersection of Two Arrays | https://leetcode.com/problems/intersection-of-two-arrays/ |
| Design HashSet | https://leetcode.com/problems/design-hashset |
| Count the Number of Consistent Strings | https://leetcode.com/problems/count-the-number-of-consistent-strings |
| 문제이름 | 문제링크 |
|---|---|
| 대칭 차집합 | https://www.acmicpc.net/problem/1269 |
| 서로 다른 부분 문자열의 개수 | https://www.acmicpc.net/problem/11478 |
| 소인수분해 | https://school.programmers.co.kr/learn/courses/30/lessons/120852 |
| Maximum XOR of Two Numbers in an Array | https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array |
| Longest Consecutive Sequence | https://leetcode.com/problems/longest-consecutive-sequence |
| Repeated DNA Sequences | https://leetcode.com/problems/repeated-dna-sequences |
| 문제이름 | 문제링크 |
|---|---|
| 문자열 집합 | https://www.acmicpc.net/problem/14425 |
| 집합의 표현 | https://www.acmicpc.net/problem/1717 |
| 친구 네트워크 | https://www.acmicpc.net/problem/4195 |
| Smallest Range Covering Elements from K Lists | https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists |
| Making A Large Island | https://leetcode.com/problems/making-a-large-island |
| Longest Common Subpath | https://leetcode.com/problems/longest-common-subpath |
| 문제이름 | 문제링크 |
|---|---|
| DFS와 BFS | https://www.acmicpc.net/problem/1260 |
| 바이러스 | https://www.acmicpc.net/problem/2606 |
| 단지번호붙이기 | https://www.acmicpc.net/problem/2667 |
| 미로 탐색 | https://www.acmicpc.net/problem/2178 |
| Find the Town Judge | https://leetcode.com/problems/find-the-town-judge/ |
| Find if Path Exists in Graph | https://leetcode.com/problems/find-if-path-exists-in-graph/ |
| Find Center of Star Graph | https://leetcode.com/problems/find-center-of-star-graph/ |
| Node With Highest Edge Score | https://leetcode.com/problems/node-with-highest-edge-score/ |
| 문제이름 | 문제링크 |
|---|---|
| 게임 맵 최단거리 | https://school.programmers.co.kr/learn/courses/30/lessons/1844 |
| 깊이/너비 우선 탐색(DFS/BFS) | https://school.programmers.co.kr/learn/courses/30/lessons/43165 |
| 타겟 넘버 | https://school.programmers.co.kr/learn/courses/30/lessons/43165 |
| 문제이름 | 문제링크 |
|---|---|
| N과 M (1) | https://www.acmicpc.net/problem/15649 |
| N과 M (2) | https://www.acmicpc.net/problem/15650 |
| N과 M (3) | https://www.acmicpc.net/problem/15651 |
| N과 M (4) | https://www.acmicpc.net/problem/15652 |
| Permutations | [🔗 LeetCode](https://leetcode.com/problems/permutations/) |
| Combinations | [🔗 LeetCode](https://leetcode.com/problems/combinations/) |
| Subsets | [🔗 LeetCode](https://leetcode.com/problems/subsets/) |
| Generate Parentheses | [🔗 LeetCode](https://leetcode.com/problems/generate-parentheses/) |
| 문제이름 | 문제링크 |
|---|---|
| 부분수열의 합 | https://www.acmicpc.net/problem/1182 |
| 로또 | https://www.acmicpc.net/problem/6603 |
| 연산자 끼워넣기 | https://www.acmicpc.net/problem/14888 |
| Combination Sum | [🔗 LeetCode](https://leetcode.com/problems/combination-sum/) |
| Combination Sum II | [🔗 LeetCode](https://leetcode.com/problems/combination-sum-ii/) |
| Path Sum II | [🔗 LeetCode](https://leetcode.com/problems/path-sum-ii/) |
| 문제이름 | 문제링크 |
|---|---|
| N-Queen | https://school.programmers.co.kr/learn/courses/30/lessons/12952 |
| 소수 찾기 | https://school.programmers.co.kr/learn/courses/30/lessons/42839 |
| 양궁대회 | https://school.programmers.co.kr/learn/courses/30/lessons/92342 |
| N-Queens | [🔗 LeetCode](https://leetcode.com/problems/n-queens/) |
| Letter Combinations of a Phone Number | [🔗 LeetCode](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) |
| Palindrome Partitioning | [🔗 LeetCode](https://leetcode.com/problems/palindrome-partitioning/) |
| 문제이름 | 문제링크 |
|---|---|
| 피보나치 수 1 | https://www.acmicpc.net/problem/24416 |
| 1로 만들기 | https://www.acmicpc.net/problem/1463 |
| 계단 오르기 | https://www.acmicpc.net/problem/2579 |
| RGB거리 | https://www.acmicpc.net/problem/1149 |
| 문제이름 | 문제링크 |
|---|---|
| 동전 0 | https://www.acmicpc.net/problem/11047 |
| ATM | https://www.acmicpc.net/problem/11399 |
| 회의실 배정 | https://www.acmicpc.net/problem/1931 |
| 잃어버린 괄호 | https://www.acmicpc.net/problem/1541 |