[2025/03/22] 2685. Count the Number of Complete Components
·
알고리즘 챌린지
leetcode.com 의 dilay qeustion 을 매일 풀어보고 있습니다!https://leetcode.com/problems/count-the-number-of-complete-components/description/?envType=daily-question&envId=2025-03-221. 문제 소개## Problem DescriptionYou are given an integer `n`. There is an **undirected** graph with `n` vertices, numbered from `0` to `n - 1`. You are given a 2D integer array `edges` where `edges[i] = [ai, bi]` denotes that there e..