Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[NEW ALGORITHM] Tiling Problem DP #1802

Closed
2 tasks done
NK-Works opened this issue Nov 9, 2024 · 1 comment · Fixed by #1825
Closed
2 tasks done

[NEW ALGORITHM] Tiling Problem DP #1802

NK-Works opened this issue Nov 9, 2024 · 1 comment · Fixed by #1825
Assignees
@NK-Works
Labels
gssoc-ext level1 new algorithm

Comments

@NK-Works
Copy link
Contributor

NK-Works commented Nov 9, 2024

Issue will be closed if:

  1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
  2. You propose an algorithm that is already present or has been mentioned in a previous issue.
  3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

Name:

Tiling Problem

About:

The Tiling Problem is a classic problem in dynamic programming, where the task is to determine the number of ways to completely cover a 2xN board using 2×1 tiles.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
@pankaj-bind
Copy link
Member

assigned

@NK-Works NK-Works mentioned this issue Nov 9, 2024
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@NK-Works NK-Works

Labels
gssoc-ext level1 new algorithm
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Tiling Problem DP Added NK-Works/C
2 participants
@pankaj-bind @NK-Works