Friends Pairing using Backtracking | Backtracking Problems in JAVA
Vložit
- čas přidán 21. 08. 2020
- Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. This video discusses the alternate approach for the Friends Pairing problem using Recursion and Backtracking. In this problem,
1. You are given an integer n, which represents n friends numbered from 1 to n.
2. Each one can remain single or can pair up with some other friend.
3. You have to print all the configurations in which friends can remain single or can be paired up.
The approach for solving using dynamic programming can be seen here: • Friends Pairing Proble... .
.....................................................................................................................................................................
Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skilful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.
For better experience and well organised free resources visit - nados.pepcoding.com/feed
We also provide professional courses with live classes and placement opportunities.
DSA Level 1 and Level 2
czcams.com/users/Pepcodingp...
Webinar on GATE Preparation
• Video
Here is a roadmap to our Free study content and know more about our resources here - www.pepcoding.com/resources/
We are also available on the following social media platforms: -
Facebook(Meta) - / pepcoding
Instagram - / pepcoding
LinkedIn - / pepc. .
Pinterest - / _c. .
Twitter - / pepcoding
CZcams (English Channel)- / @pepcodingprogrammingi...
Also take a look at our placement assistance - www.pepcoding.com/placements
HAPPY PROGRAMMING!
Pep it up.....
#recursion #friends pairing #backtracking
This question is actually full of small concepts. It took me a few hours to get the small code.
this is BEYOND SUPER stuff!!!
sir, aapke dedication ko saalam
Love the explaination!!
thank you. as usually quality content.
Glad you enjoy it!! share it as much as you can
Sir aapki backtracking ki videos bahut acchi hai bahut kuch seekhne ko milra hai thanku
Seekhte reh mere bhai. Mai bnata rahunga
Thanks!
You have really amazing teaching skills! am pleased to see your efforts and work on each questions. You always explain in very much detailed on each questions. Just a request to add time and space complexity in the coming each new videos then your videos will be complete package. Thank you so much!
hanji, bhool ja rhe hain. aage se dhyaan rakhenge.
@@Pepcoding keep last 1 to 2 min for time and space complexity then your videos will be really a complete package of everything. Thanks once again for your all the hard work and efforts. You will see a very good success on your channel in coming months. All the videos are that Good and fantastic!
Crystal clear
nice explanation!!
You are one of the best teacher thanku for uploading such contents
Thanks and welcome
If you like my efforts, I request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
czcams.com/users/Pepcodingabout?view_as=subscriber
For clearing your doubts, you can join our community on telegram
t.me/pepcoding
thank you sir❤❤🙏🙏
sir , you technique of teaching is really nice
Keep Watching and Glad you liked it !! share among your friends
hey Sir.
Can we do thisproblem like K partition problem???
matlab isme kya hoga ki hum max to max 'n' partition kar sakte hain.
and each partition mein 2 se jyaada person nahi aa sakte.
aur base case mein hum check karenge ki if(index==n) {count++;}
Excellent explanation sir🔥🔥🔥💯💯💯
Glad you like the video.
For better experience and well organised content sign up on nados.io
Don't forget to follow us on Instagram instagram.com/pepcoding/
time complexity - O(o^l)
space complexity - O(l)
where o and l are options and levels respectively
is this correct ?
Excellent sir 👍🔥
Glad you liked it!
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
Sir LevelUP and IP combined kab tak complete ho jayga?
Sir if possible post ques. Of Trees and DP side by side.
Loving your content very much.🔥🔥❤️
October 30 max se max
Sir, at 44:40 aapne kaha hai ki isme humse permutation banne se roka hai kyunki humne loop (i+1) se chalaya hai, 1 se nhi , Sir agar hum loop 1 se bhi chalaaye tab bhi koi dikkat nhi hai kyunki 'i' se piche wale bande already used mein true honge toh unpe call jaayegi hi nhi, toh permutation generate nhi hongi. iss code mein (j=1;j
Haan. True
@@raja17 bro, MAIT CSE 2020 batch(C - 456) , if I identify you correctly?
@@ayushgoel9584 yes bhai xD
Koi whatsapp group h ? coding doubts ke liye?
@Ayush Goel
@Raja Bhardwaj
Sir will you cover the list of imp. questions that you've provided in this course?
Are there any chances for getting into product based compnies after completing all the three courses.
Yes! that list will also be covered. All these questions + OS + DBMS + projects will be required for getting a decent job.
Hi Brother, I found that in this question (online-java-foundation -> recursion-on-the-way-up -> print-kpc-official) on website, you have given link of solution video in place of question video. I am commenting here because this is the new view and I hope you will read this comment.
Thank you! will update it.
sir isme agar sirf number of ways nikalne ho that will be done using dp right?
Absolutely!
@@Pepcoding sir list karke bhi google Online assessment ki insight nahi ban rahi thi, :( sir is cp important for online tests
Hi sir, I'm currently working in service based company. I have completed the foundation course, Should I wait for interview Prep course or level up is also required to crack product based company.
No need for level up aap beta interview prep join kijiee.
hey bro how much time you get for preparation as you are also working?
I'm the only person who Subscribed this channel from my all three accounts 😅.
Kuki Sumeet Bhaiya ko famous karna h!
Hahaa !! beta ghrr ke srre members ke account se krdoo 😅 !! Thank You very much
@@Pepcoding Bilkul sir❤️
Great video sir ,sir iski time complexity kya hogi?
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
@@Pepcoding ok sir no problem
sir please post video on magnets official.
Hanji beta, ek bari jo agenda main questions h vo complete kr le, then ye sb cheeze bhi cover kr lenge.
Sir strings ke lectures kab aayenge?
Beta backtracking or bit manipulation k baad!
Bhai old videos dekhle vo toh bhut chota sa h real mja toh recursion degi kya pdhaya h bhaiya ne
Sir Video Quality pls thodi improve kijiye,rest all is good .
beta youtube thodi derr baad HD process kar dega.
support.google.com/youtube/thread/15412965?hl=en
abhi premiere ke baad quality khud improve ho jaegi
There is a problem named magnet in list but no solution here...🙂.
Hanji beta, rehti h abhi uski video, jaldi daalege
Kindly please try to upload all DSA vidoes. Bahar bade bade institutions hazaro rupai charge kar rahe hai vo bhi bahut low level content ke liye and logon ko bewakoof bana rahe hai vo bhi bade institution. loot rahe hai jhoot bolkar . Kindly you can stop this because I'm saying this I'm a victim of that.
Haha keep learning and keep loving Pepcoding😊
humko level up rula raha hai.
itni mehnat mt karo sir ek dry run code se phle ek code k baad bhot h. Jisko smjh nhi aayega vo repeat kr lega.
Edit: Aur sir ho sake to hr code k end m complexity bs bta diya kro, hm khud analyze kr lenge