DaleStudy / DaleStudy/leetcode-study
Longest Common Subsequence
Open
Beginner friendly
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 LeetCode problem and the linked Algodale explanation, then inspect the longest-common-subsequence/ directory in the repository. Add the Python solution and any expected accompanying material used by neighboring problem directories, and verify the result against the linked problem examples.
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
- 62/100