[Code Addition Request]: Adding more problems in Basic DP Problems

[siri-chandana-macha]

Have you completed your first issue?

• I have completed my first issue

Guidelines

• I have read the guidelines
• I have the link to my latest merged PR

Latest Merged PR Link

N/A

Project Description

1. find the N-th Tribonacci number
Problem: Similar to the Fibonacci sequence, the Tribonacci sequence is defined as dp[n] = dp[n-1] + dp[n-2] + dp[n-3]. Given n, find the N-th Tribonacci number.

2. Subset Sum
Problem: Given a set of integers, find if there is a subset with sum equal to a given number.

3. 0/1 Knapsack Problem
Problem: Given n items with weight and value, find the maximum value you can carry in a knapsack of capacity W.

4. Paint House (with Colors Constraint)
Problem: You are tasked with painting houses. Each house can be painted in one of k colors, and no two adjacent houses can have the same color. Find the minimum cost to paint all houses.

Full Name

siri-chandana-macha

Participant Role

• gssoc-extd
• hacktoberfest
• wob

[github-actions]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!

[github-actions]

✅ This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!