dpalmasan / dpalmasan/competitive-programming
Longest increasing subsequence
Open
dynamic-programming
- Dominant language
- C++
- Stars
- 1
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
Solution for longest increasing subsequence problem.
Contributor guide
No contributing guide indexed for this repository
Research direction
No files, tests, or entry points are named. Inspect the repository's existing C++ solution organization and conventions first, then determine where the longest increasing subsequence solution belongs; done means the solution is added in the expected location and matches the project's established format.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100