Skip to content

[FEATURE REQUEST] Find the N-th Tribonacci Number missing #4646

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.

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

Closed
okaydivyansh opened this issue Oct 4, 2023 · 2 comments · Fixed by #4959
Closed

[FEATURE REQUEST] Find the N-th Tribonacci Number missing #4646

okaydivyansh opened this issue Oct 4, 2023 · 2 comments · Fixed by #4959

Comments

@okaydivyansh
Copy link

okaydivyansh commented Oct 4, 2023

What would you like to Propose?

I explored the Dynamic programming ( thealgorithms/dynamicprogramming/ ) and wasn't able to find the standard problem of finding the n-th tribonacci number in the series. Would be better if you we could add those the repo.

Issue details

The problem involves dynamic programming to find nth tribonacci number and is a very standard problem.
I would like to Contribute to it as my first hacktoberfest Contribution. So can you pls assign it to me , I have The code ready.
problem link: https://leetcode.com/problems/n-th-tribonacci-number/description/

Additional Information

No response

@okaydivyansh
Copy link
Author

please label this with hackertoberfest

@okaydivyansh okaydivyansh changed the title [FEATURE REQUEST] Count the number of set bits missing in Bit Manipulation [FEATURE REQUEST] Find the N-th Tribonacci Number missing Oct 4, 2023
@hydraveer
Copy link

please assign this for me

ylcn91 added a commit to ylcn91/Java that referenced this issue Nov 6, 2023
This PR introduces the `Tribonacci` class to the `dynamicprogramming` package. It implements an efficient method to compute the N-th number in the Tribonacci sequence as defined by the problem statement on LeetCode: https://leetcode.com/problems/n-th-tribonacci-number/description/.

## Changes Made

- Added `Tribonacci.java` with a static `compute` method.
- Included tests in `TribonacciTest.java`.

The `compute` method calculates the N-th Tribonacci number using an iterative approach with O(n) time complexity and O(1) space complexity, which is optimal for the constraints given.
@ylcn91 ylcn91 mentioned this issue Nov 7, 2023
6 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants