| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- algorithm
- 메모이제이션
- Interval
- Sorting
- CPP
- graph
- Array
- Sort
- Greedy
- Depth-First Search
- 탐욕알고리즘
- binary search
- DFS
- 배열
- 비트 연산
- bitwise operation
- 이진탐색
- 동적계획법
- 알고리즘
- unordered_map
- bit manipulation
- linked list
- union-find
- binary
- LeetCode
- 비트 조작
- hash table
- dynamic programming
- C++
- 깊이 우선 탐색
- Today
- Total
목록2022 Algorithm Study(by leetcode) (44)
공대생 공부노트(Notes for Engineering Studies)
Number of Connected Components in an Undirected Graph - LeetCode Account Login - LeetCode 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 (Number of Connected Components in an Undirected Graph는 LeetCode Premium 문제로 위 링크 혹은 LintCode를 통해 풀어보실 수 있습니다.) < Number of Connected Components in an Un..
https://leetcode.com/problems/graph-valid-tree/ (Graph Valid Tee 문제는 LeetCode Premium 문제로 위 링크 혹은 LintCode를 통해 풀어보실 수 있습니다.) Graph Valid Tree 문제는 다음과 같다. Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree. Note: you can assume that no duplicate edges will..
https://leetcode.com/problems/meeting-rooms/ Account Login - LeetCode 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 (Meeting Rooms 문제는 LeetCode Premium 문제로 위 링크 혹은 LintCode를 통해 풀어보실 수 있습니다.) Meeting Rooms 문제는 다음과 같다. Given an array of meeting time intervals where i..
Non-overlapping Intervals - LeetCode Non-overlapping Intervals - LeetCode 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 (Non-overlapping Intervals 문제는 위 링크에서 풀어보실 수 있습니다.) Non-overlapping Intervals 문제는 다음과 같다. Given an array of intervals intervals where..
https://leetcode.com/problems/merge-intervals/ Merge Intervals - LeetCode 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 (Merge Intervals 문제는 위 링크에서 풀어보실 수 있습니다.) Merge Intervals 문제는 다음과 같다. Given an array of intervals where intervals[i] = [starti, endi], merge al..
https://leetcode.com/problems/insert-interval/ Insert Interval - LeetCode 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 (Insert Interval 문제는 위 링크에서 풀어보실 수 있습니다.) Insert Interval 문제는 다음과 같다. You are given an array of non-overlapping intervals intervals where inter..
Number of Islands - LeetCode Number of Islands - LeetCode 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 (Number of Islands 문제는 위 링크에서 풀어보실 수 있습니다.) Number of Islands 문제는 다음과 같다. Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (..
Longest Consecutive Sequence - LeetCode Longest Consecutive Sequence - LeetCode 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 (Longest Consecutive Sequence 문제는 위 링크에서 풀어보실 수 있습니다.) Longest Consecutive Sequence 문제는 다음과 같다. Given an unsorted array of i..