DaleStudy / DaleStudy/leetcode-study
Lowest Common Ancestor of a Binary Search Tree
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 with the linked LeetCode problem and Algodale explanation, then inspect the lowest-common-ancestor-of-a-binary-search-tree directory in the repository. Add the Python solution for the stated problem there and verify that it handles the required binary-search-tree cases.
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
- Clearly specified
- Newbie friendliness
- 45/100