Subsets 2 (Leetcode 90) - Medium (Hindi) | Facebook Interview Question

[@ksciencebuddy]

best series encountered so far without using unneccessary logics - beginner friendly !!

[@abhinavkumar7730]

I remember I was struggling with the concept, your videos aided me a lot. Cheers....!

[@CodingWithPrakash_]

Wow

[@sanjana8267]

Sir I have seriously struggled a lot with this stuff, thank you so much!

[@zeta_meow_meow]

nice and simple v

[@desibhojan8287]

Good 👍😊

[@DsaTraveller]

great playlist

[@niteshgupta1118]

Finally. Understood this one.

[@khushichouksey253]

agr if we will continue when 2 comes again then how [1,2,2] will be formed?

[@Rajmayank24]

There will be no base case ??

[@adarshupadhyay8265]

What will be the time and space complexity of this solution?

[@CodingWithPrakash_]

Watch subset video in this playlist for time and space complexity

[@KalpitSharma]

Permutation k videos nahi dikh rhe

[@theuntoldtree]

isme set vala trika thoda sa bta dete to sahi rehta

[@theuntoldtree]

sir missed one major point , saying sort the array

[@mohitkumar557]

if you sort the given array before any operation then the power set will be in the lexicographical order. That's it.

[@sudiptodas6272]

class Solution: def subsetsWithDup(self, nums): index=0 current=[] residual=[] nums.sort() return (self.subset(index,nums,current,residual)) def subset(self,index,nums,current,residual): current.sort() if current not in residual: temp=copy.deepcopy(current) residual.append(temp) for i in range(index,len(nums)): current.append(nums[i]) self.subset(i+1,nums,current,residual) current.pop(len(current)-1) return residual ** the filter logic is little complex to understand simple : sort the array b4 passing : nums.sort() before pushing to residual sort and check check if it is already present : current.sort()

[@CodingWithPrakash_]

✅ Useful Links 𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - instagram.com/codingwithprakash/ 𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/channel/0029VaACtTa4tRrpDCQc5f44 𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - www.linkedin.com/in/prakash-shukla/

[@PROTECHRAHUL]

Bhaiya bina back tracking k nhi ho sakta kya?

[@CodingWithPrakash_]

Ho sakta hai but backtracking is used to optimization You can use brute force too

[@sanskartayal7257]

why it is i>start i cannot understand

[@a.yashwanth]

How will u compare something(i) with previous value(i-1) when you are at the starting value(start) where you dont have any previous value(start-1).

[@amansayer4943]

@@a.yashwanth thanks bhai .that could be said by sir but he messed it up .thanks buddy