keshavMM004/InterviewQuest

META interview question

Open

#4 opened on Oct 7, 2024

View on GitHubContributor guide
 (0 comments) (0 reactions) (0 assignees)Java (0 forks)auto 404
hacktoberfest

Repository metrics

Stars
 (0 stars)
PR merge metrics
 (PR metrics pending)

Description

Given the root of a binary tree, return the diameter of the tree, which is the length of the longest path between any two nodes. This path can pass through the root but doesn't have to.

The length of a path between two nodes is defined by the number of edges connecting them. leetcode

Contributor guide

Research direction
Implement a depth first search (DFS) that computes the height of each subtree and tracks the maximum diameter encountered.
Tech stack
java
Domain
None
Issue type
Research
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Binary TreesRecursion
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60