DaleStudy / DaleStudy/leetcode-study
Number of Connected Components in an Undirected Graph
Open
Nobody has claimed this yet.
problem
- Dominant language
- Python
- Stars
- 156
- Forks
- 359
- Avg merge
- 1d 16h
- Merged PRs (30d)
- 38
Description
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the problem statement and explanation linked in the issue, then inspect the number-of-connected-components-in-an-undirected-graph directory for the repository's expected solution structure. Add the solution there and verify it against the linked problem's examples and constraints.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- data
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 55/100