공대생 공부노트(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..

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..