Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

Longest increasing subsequence

Open
#25 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
3/5
Estimated time
1-2 days
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
cpp
Domain
data

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.

Description

dynamic-programming

Solution for longest increasing subsequence problem.

Dominant language
C++
Stars
1
Forks
0
PR merge metrics
No merged PRs in 30d

Getting set up

This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from dpalmasan/competitive-programming

All issues in dpalmasan/competitive-programming

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.