search

HarshCasper / NeoAlgo

Bringing all Data Structures and Algorithms under one Roof âš¡
MIT License
875 stars 1.05k forks source link

Connect n ropes with minimum cost #7560

Closed JayantGoel001 closed 2 years ago

JayantGoel001 commented 2 years ago

💥 Proposal

(There are given n ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to the sum of their lengths. We need to connect the ropes with minimum cost.)

Have you read the Contributing Guidelines on Pull Requests?

(YES)

github-actions[bot] commented 2 years ago

Hello @JayantGoel001,
Thank you for opening an issue. :partying_face:
To get assigned to this particular issue please use /assign
Check this guide before contributing.

JayantGoel001 commented 2 years ago

/assign

github-actions[bot] commented 2 years ago

This issue has been assigned to @JayantGoel001! It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.