The famous rope cutting problems reads - Given a rope of length n, you need to find the maximum number of pieces you can make such that the length of every piece is in set (a,b,c) for the given three values of a,b,c.
This problem is also known as rod cutting problem in x, y, z segments,
So we will be getting values of n, a, b, c. So we have a rope of n length and we have cut this rope to obtain the maximum pieces in such a way that the length of pieces should either be a or b or c.
So are we going to solve this question?
We can solve this question recursively because it satisfy all the conditions of recursion and we have a base condition for this question.
Check out the entire lecture to know the logic behind the rope cutting problem in java and find the correct solution to the problem.
Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course.
Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - • Data Structures And Al...
For more information, fill this form: forms.gle/8eiU...
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacad...
#dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder
Негізгі бет Solution Of Rope Cutting Problem Using Recursion | FREE DSA Course in JAVA | Lecture 42
No video
Пікірлер: 28