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

Merge elements using dynamic programing #3281

Open
2 tasks done
shobhit9070 opened this issue Oct 9, 2022 · 3 comments
Open
2 tasks done

Merge elements using dynamic programing #3281

shobhit9070 opened this issue Oct 9, 2022 · 3 comments
Labels
hacktoberfest

Comments

@shobhit9070
Copy link
Contributor

shobhit9070 commented Oct 9, 2022 •
edited
Loading

This is a(n):

  • New algorithm
  • Update to an existing algorithm

Details:

efficient way to merge elements in the array by taking the minimum cost. Great interval dyanmic programing question.
Please assign this issue to me under hacktoberfest 2022
@shivesh41kr
Copy link
Contributor

Hello Sir, please assign this issue to me.

@shobhit9070 shobhit9070 mentioned this issue Oct 10, 2022
Merged
@UTKARSHMOHAN2003
Copy link

HELLO SIR PLS ASSIGN ME THIS
I WANT TO ADD CODEE

@shubhgoel03
Copy link
Contributor

sir pls see the code i have added i have explained it properly with code approach and complexity in C++

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
hacktoberfest
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
5 participants
@ZoranPandovski @shobhit9070 @shivesh41kr @UTKARSHMOHAN2003 @shubhgoel03