Sum of Subset Problem | Backtracking Method | Design & Algorithms | Lec-54 | Bhanu Priya

preview_player
Показать описание
Backtracking Method: Sum of subset problem example
Рекомендации по теме
Комментарии
Автор

Really i like your videos and ur explination also really super naku me videos thapa enka avrvi chudali ani pinchadhu

kethalabhargavi
Автор

madam vizag aa? telugu baga matladaru...means ikkada. btw best tutorials ever <3

soulreaper
Автор

U explain so well without unwanted talk😇

shrutikalamkar
Автор

Thank you so much mam for your explanation. I have watched so many lectures about this topic but I couldn't understand 🙂. But now watching your lecture I understand 😇

rohitsahoo
Автор

thanks Bhanu Priya, very well explained. please make more on this backtracking recursion state space trees. it helped me solve and understand a problem with ease

hyomhhq
Автор

Yhi wala example agya ppr m 10 no. ka🤑🫠🥹🥹🥹 ab 10 mrks pakke thnku mam🫣♥🥲

khushigola
Автор

hello mam this is Akhil. ur vedios are gud and students can able to understand by ur explanations.ana easy to analyze, comparing to another vedios, ur vedios are likely to be best mam.

aakhilvs
Автор

Thanks, good explanation on how the graph nodes express on doing the subset sum

ivandrofly
Автор

I watched many lectures of this topic but my concept wasn't clear. Tommorow is my exam and found this lecture, I am confident that I'll be able to solve this in exam. Thanks ma'am.

ankuryadav
Автор

We find good xplination for any computer science concepts here👍👍

rohitkunta
Автор

Thank u so much man...
Ur channel absolutely superb very helpful me....

almasmawiya
Автор

I saw a lot of videos of the formulas blah blah blah ur explanation is great.

abdulmukith
Автор

Really helpful for my exam at last min thank you so much

chandinidokkada
Автор

Thankyou madam, explained very easily

darkgaming
Автор

madam please explain the Hamilton cycle for easy way

mahamahalakshmi
Автор

Thank you mam your explanation is osm but you haven't covered some topics and I want to learn from your teaching I am addicted to your explanation I don' t want to watch other vid

neelimakadagam
Автор

Thank u so much maam understood it very well

omarabdullasherief
Автор

Mam sach me aap ko pranam hai aap life saver ho aapne hamari bahut madat Kari hai itne ache se explain kr ke ❤❤

asvisuals
Автор

Should we still continue after finding a solution? In this case, we found the solution at x1x2x3=1. Do we still need to traverse the whole tree again?

MScCSIT-xrey
Автор

Where is the need for rearranging the elements of the orgiginal set in ascending order ? The procedure works even without rearranging the elements.

c.danielpremkumar