Mahmoud and Ehab DP Concept Doubt

#61

there is no reason behind {x,i} or {i,x}
tum dono se kar sakte ho , thoda bahut chnages karne padenge kisi aur jagah pe.

#62

Bhaiya, mera kahane ka matlb hai humne (x,i) ya (i,x) ka hi pair kyun liya, kyun nhi (l,i) ya fir (x,l)…
v[l-1].push_back({x,i});
‘l’ ko bucket ka index lene ka to kuch karan hoga…

#63

@Kinjal
see ->
image

1 Like
#64

Ese, 109 ms konsa le rha hai?

#65

{i,x} wala i guess .

#66

Bhaiya, input lene ka tarika ko hashmap with chaining ke tarah visualize ke rhe hai…
bas yha peh hashmap ke jagah vector hai aur chaining ke jagah bhi vector hai with storing pair of elements.

#67

ha aise bhi kar sakte ho visualize

#68

Bhaiya, seg fault de rha hai…

#69

sorry for late response bro ,kal mein available nahi tha
ab bhi hai kya kuhc issue isme

1 Like
#70

Bhaiya, thoda mera approach dekhiye…vector and set dono ka istamal kiye hai. Magar error de rha hai, whi pata nai chal rha…

#71

@Kinjal

image

tum empty vector pe indexing use kar rahe ho isliye.
iska size define karo

#72

Bhaiya, code chal gya…

Bhaiya, ways of set of xor value kabhi bhi odd number ho nhi sakta kya?

#73

cant comment. … . …

#74

Maine observe kiya hai ki, iss logic meh humesha ans ka value even number hi generate hoga, kyun ki ans=2*ans ho rha hai so isiliye puche?

#75

answer 1 bhi ho sakta hai na…

#76

Bhaiya, {0,1} iss dp problem ka base value hai na…aur ha, 1 hi ek odd value ans meh ho sakta hai…

#77

ha. . . . . . … …

#78

Bhaiya, iss dp problem se take away yah mila ki iss problem ka mathematical proof hi yaad rakhna hai…

#79

experience mila …jo baaki problem mein kaam aayega

1 Like