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

U explain so well without unwanted talk😇

Thank you! Finally Understood! :)

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

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

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 😇

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

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

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

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.

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

Thankyou madam, explained very easily

Thanx a lot. Understood.

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.

Thank u so much maam understood it very well

thank u mam understood well

Thank you🙌🏼

Very good explanation madam.

Thankyou mam I understanding that problem

Thank you so much.......❤

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?

Thanku..💜

Amazing.u r... thanks

Wow teaching mam 👍👍

Video is Useful 👍

Thanku so much ma'am 😊 ❤️

Easy Thank You!!

Nyc explanation man

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

Perfectly understud ☺

great explanation mam 👏👏👏

madam please explain the Hamilton cycle for easy way

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

thankyou

Welcome

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

Plz explain hamiltonian circuit problem using backtracking

Thank you so much mam

Thank u👍

helped 😊 tq

Ty didi

Thanku so much maim 🥰

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

How to take d value?

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

Thank you mam

Thanku mam

❤❤❤❤🤗

Mam plz Provide Unit 5'notes your lectures easier daa to me thinks a lot

You have very nice voice 😁

abdul bariii❤

Mam, explain branch and bound method give one example of knapsack problem.

Madam inka continue cheyalede mam

good

Madam graph coloring and Hamilton cycles e topics tutorial anduku cheyyaledu

7:40 instead of skipping the addition it's ok if we add and write

Mam aap zahar ho..

Can anybody please provide pseudo code?

Ma'am is this backtracking method or state space tree method

After e there comes d

Plzzzzzz mam I request u Plzzzzzz explain branch ND bound and all applications plzzzzzzzzzz

But you are not solving this with backtracking method ....

np complete and np hard wants to teach me

3:19 me kuch to gadbad hai😂😂

voice koncham increase cheyandi mam..

0/1knapsack

Riya right?

can the solution be 0?