This type of explanation and content at free of cost , thank you sir

Falling in love with your teaching style

One of the best explanation to this problem... I literally understood everything. Gonna recommend my friends as well.

@Pepcoding

3 жыл бұрын

Thanks for sharing

@ankurkumar8465

3 жыл бұрын

@@Pepcoding Sir but why are you uploading all your paid courses for free of cost??? It will definately cause you heavy losses i guess

its called perfection ! Explaination was amazing. well My senior(Sunny bhaiya) joined pepcoding as instructor last year .

@Pepcoding

3 жыл бұрын

agar aapko mza aya to kya aap google pe hmara ek review daal sakte hain www.google.com/maps/place/PepCoding.com/@28.6993713,77.1360927,17z/data=!3m1!4b1!4m7!3m6!1s0x390d03d054d3e717:0x4fd0fdfc3f27ffaf!8m2!3d28.6993666!4d77.1382814!9m1!1b1

you know what after watching striver and some other videos I have came to conclusion that he's the best teacher just not famous enugh

Zero dislikes shows the level of content you are providing sir !!

@Pepcoding

3 жыл бұрын

If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )

Thank you so much sir❤❤

Amazing explanation sir

Hi. the explanation is very good. However I could not understand(from coding point of view) how different array lists are generated using the recursion. It will more good if we are able to explain this too.

Great explanation Sir ! Well done !

@Pepcoding

3 жыл бұрын

Thankyou beta! I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. Will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms)

@vishwashdwivedi9469

3 жыл бұрын

@@Pepcoding Done Sir , Also I recommended your channel and website to my friends and shared your page on instagram too !

very nice

we can also avoid permutations here by making only one call at start

@guptapaaras

3 жыл бұрын

Yup, Agreed there is no need to generate permutations.

@vantal4115

2 жыл бұрын

Can u provide the code for the same

try checking on leetcode sir, the -36,36 test case fails

will this work for negative element

I think time complexity should be 2^n because for each value we have 2 choice i.e :-- 1.include in subset 1 and not in subset 2. 2.include in subset 2 and not in subset 1. Hence there will be 2^n functions calls hence time complexity is 2^n.

awesomeeee sir, solution of the problem is not enough but the excellent solution of problem is matter ,and sir you provide the excellent solution of any problem.thnk u soo much sir

@Pepcoding

3 жыл бұрын

Thankyou beta! I am glad you liked it. It's all with the effort and hardwork from our brilliant mentors(Subhesh sir and all the other teacher of pepcoding). If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )

Sir agar min ya max function k andar do recursive function call ho rahe ho,to wo kis order se execute hote hai. for example min(find(n-2),find(n-1)).

@swapnildhiman6585

2 жыл бұрын

I think find(n-2) will do the whole recursive operation till it reaches the base case and then will start comparing with function(n-1)

@derilraju2106

2 жыл бұрын

inner to outer

sir set1.size()

@sharuk3545

3 жыл бұрын

you can also use

@curiouswatcher4626

3 жыл бұрын

if you notice the euler the combinations you think will be missed are present on other branches , the avoided combinations are the ones that were not going to be useful anyways .

why need to maintain two sum, sum2 alwasy be totalsum-sum1, so just calculate total sum once when calling

shoudln't it be set/size()

@rishabs5991

3 жыл бұрын

Set.size()**

@gulshansharma9377

2 жыл бұрын

If we do this, then we are making a call even if we got the max size of set... As per your example then we are making a call when the size is 3... which is not needed ... that's why set.size

@aahanaganjewar9951

2 жыл бұрын

if you make it

Good explanation sir🙏

@Pepcoding

3 жыл бұрын

Thanks and welcome. I request you to help us get a webinar in your college.

@rahulbhatia3075

3 жыл бұрын

@@Pepcoding sir ham amity mai hai. Yaha padhne likhne ka mohol nhi hai😂😂😂

@vishalkushwaha5373

3 жыл бұрын

@@rahulbhatia3075 LMAO😂😂😂

Time and space complexity's kra do sir please sir bahut ajeeb lagta hai question samgha me as jata Vai wo pta nhi rhta hai please sir aur eski time complexity o(2^n) hogi Kya kyoki her value ke pass 2 option hai so 2^n hoga

@Pepcoding

3 жыл бұрын

Hanji beta, jaldi resume krege content bnana

sir level up k recursion and backtracking m kitne ques aayenge around?

@Pepcoding

3 жыл бұрын

Total 50. Abhi abhi 22nd dala hai

@code7434

3 жыл бұрын

@@Pepcoding sir 2 shift me krdena ,please abhi k lie doosre topic pe jump krdo please :)

Explanation was cool. But bro please explain in English so that everyone could get benefited.

Sir recursion k bahut sare achche questions krne hain sir aap recursion axxxe se explain Krte ho... Sir aur axxe axxe questions post kro sir plz.. Abhi wo confidence ni Aa rha abhi tak jo playlist ki h usse intermediate questions ko krne m dikkat Aa rhi Recursion k....

@Pepcoding

3 жыл бұрын

beta level1 aur level2 ki recursion karne ke baad recursion mei nahi fassoge.

@deepakojha151

3 жыл бұрын

@@Pepcoding sir can you tell me the level 2 and level 3 Questions will be uploaded or not ... Apart from level 1 only recursion and backtracking part is uploaded in level 2 and rest level 2 and level 3 is still empty on your site pepcoding....

@Pepcoding

3 жыл бұрын

@@deepakojha151 yes of-course. bass slow chal rha hai. Par lage hue hain

@deepakojha151

3 жыл бұрын

@@Pepcoding thanxx a alot sir for your love and support..... Bss aise hi aashirwad banaye rakhiye place hone. Pe aapko credit pakka...

why permutation? it should be combination

Can anyone send thier implementation in python. Mine is not working.

@derilraju2106

2 жыл бұрын

class Solution: def solve(self,n,arr): self.min = float("inf") self.ans="" self.backtrack(arr,[],[],0,0,0,n) print(self.ans) def backtrack(self,arr,arr1,arr2,i,sum1,sum2,n): if i==n: if abs(sum1-sum2) self.min = abs(sum1-sum2) self.ans = '[' + ', '.join(map(str,arr1)) + "] [" + ', '.join(map(str,arr2)) + "]" return if len(arr1) arr1 += [arr[i]] self.backtrack(arr,arr1,arr2,i+1,sum1+arr[i],sum2,n) arr1.pop() if len(arr2) arr2 += [arr[i]] self.backtrack(arr,arr1,arr2,i+1,sum1,sum2+arr[i],n) arr2.pop() n = int(input()) arr=[] for i in range(n): arr.append(int(input())) obj = Solution() obj.solve(n,arr)

this logic/code won't work for array having duplicate elements.

@dipeshsaili4468

2 жыл бұрын

then what, any more logic we can apply?

@learner5358

2 жыл бұрын

it worked for me