literally... You have content quality Supremacy in Indian TH-cam CP community .. No One comes close ..... It's so rare to find these topic other than Blogs [ which are hard to understand ] ... Thanks for bringing these gems out of your arsenal.
Your content is really helpful. I Did not know of this way to hash sets, always used to make polynomial hashes based on the frequency of elements, Thank You :)
I usually do the following, while choosing the hashing parameters. First use truly random values, I have a list of 20 prime numbers above a billion, and randomly select one of them at runtime. Furthermore, we don't need to limit ourselves to double hashing.I instead use Log(n) hash functions, there by reducing the chance of hash collision significantly.
Agreed that for most problems choosing LogN hash functions isn't necessary. But this is of theoretical interest, since this means we can get the probability arbitrarily low. And we can prove that it takes more time than number of atoms in the universe to reverse engineer all hash functions.
@@vivekgupta3484 true, but a recent codeforces div2 F was block cut tree, and the icpc regionals hardest was auxiliary trees. Maybe you can discuss those 2 problems.
please make a vedio based on the c problem of cf round good bye 2022 .as it basrd CRT which is rarely discussed and its understanding is important. also refer similer problems
For the question discussed in the video and the nice explanation you gave for set hash what if for suppose we are adding a to range then we can simply add a + a*a + a^3 + ...... + a^p = G.P. sum of p terms (where p we can take as some predefined value) to that range. Will it work or not?
first of all happpy new year Hey , it's good to see you doing good for community can u please do a course for free as there r course but r paid .. u being best The approach u have now after so many questions would be best learning that approach would help everyone
For the XOR hash part , I wondering if there is some way or a modification to answer a query of type , check if candy X is present in the ith jar or not
Guys I might sound silly but I really have this doubt. If I have multiple hash functions, while querying how do I know which one of those I used to hash the data to store it in my array in the first place? Cuz both the hash functions give different indexes.
I can't understand if we have arr=[1,2,3] we xor hash it and get 0 at index 2? It fails here as there are not 2 instances of every element behind? Pls explain.
Happy New Year Vivek Bhaiya Thanks for this fantastic technique. Can you provide us with some problems so we can also apply these techniques and better understand the concept?
literally... You have content quality Supremacy in Indian TH-cam CP community .. No One comes close ..... It's so rare to find these topic other than Blogs [ which are hard to understand ] ... Thanks for bringing these gems out of your arsenal.
Your content is really helpful. I Did not know of this way to hash sets, always used to make polynomial hashes based on the frequency of elements, Thank You :)
I don't know both will learn now 😂😃
Thanks for providing advance stuff you are really filling up the gap between availability of advance vs basic topics in cp
U make videos that are unique and internet does not have much information about that....really good to see unique content
I usually do the following, while choosing the hashing parameters. First use truly random values, I have a list of 20 prime numbers above a billion, and randomly select one of them at runtime. Furthermore, we don't need to limit ourselves to double hashing.I instead use Log(n) hash functions, there by reducing the chance of hash collision significantly.
This is overkill
@@vivekgupta3484 The random choice or the choosing logN hash functios?
Agreed that for most problems choosing LogN hash functions isn't necessary. But this is of theoretical interest, since this means we can get the probability arbitrarily low. And we can prove that it takes more time than number of atoms in the universe to reverse engineer all hash functions.
Something we all know, but not using/thinking while in contest. Will look at problems from this angle as well. Thank you so much 💓.
Very useful stuff indeed. Btw hello from HJB, kgp... Big admirer
learned something unique and new really thankful for this knowledge
More Energy and Power to you..!!
Thank you so much for your efforts... we love your content
Really Great tricks 🌟 thanks bhaiya ✨, for creating & posting such amazing contents here 🙂 & Also happy new year to you too.
Wow I am too Lucky to subscribe this channel😇
Nyc video bhai.....keep that coming
Happy New Year, thanks for such awesome content. Can you bring up an advanced tree series like link cut, block cut, auxiliary trees, etc.
Questions to ate nhi hai aaj kal :(
@@vivekgupta3484 true, but a recent codeforces div2 F was block cut tree, and the icpc regionals hardest was auxiliary trees. Maybe you can discuss those 2 problems.
really helpfull content, thanks i'm just want to ask you if you can do a graph workshop like the one with dp
thanks a lot sir.. Please teaches us More techniques..
as always a great video.thank you.
please make a vedio based on the c problem of cf round good bye 2022 .as it basrd CRT which is rarely discussed and its understanding is important. also refer similer problems
Keep bringing this kind of stuff ! This is not beginner level so much views will not be there but keep going
Can you make a tutorial for find the EXPECTED value..
What is not clear to me in your Set Hashing approach is, how well does that scheme do with multisets?
Awesome content man🔥🔥
Very Nice tutorial
Can you please make a video on sqrt and MO algo
Awesome Bhai❤️....can u pleaae bring up segment tree and sparse table..
Really great content .. please add some problem where we can use set hash/permutation/xor hash
Awesome content and also please try to make video on lagrange's interpolation
Next topic here! Thanks for suggesting!!
@@vivekgupta3484 thanks for choosing this topic . I would like to suggest one problem from codeforces round 841F.
Please cover CRT , that appear in cf goodbye 2022
For the question discussed in the video and the nice explanation you gave for set hash what if for suppose we are adding a to range then we can simply add a + a*a + a^3 + ...... + a^p = G.P. sum of p terms (where p we can take as some predefined value) to that range. Will it work or not?
Its a good idea .. but it doesnt follow coefficient matching logic.
U can Choose some mathematical stuff for next video
first of all happpy new year Hey , it's good to see you doing good for community can u please do a course for free as there r course but r paid .. u being best
The approach u have now after so many questions would be best learning that approach would help everyone
Making a full course on youtube takes too much of effort :( . With Job and educator works, currently its not possible. But surely someday eventually.
@@vivekgupta3484 loved the honesty
Virtual hugs bro
For the XOR hash part , I wondering if there is some way or a modification to answer a query of type , check if candy X is present in the ith jar or not
I'm a beginner at a cp where to start watching your videos??
Now I see a question where we have to use pair hash
where are you ??
Game theory be the next topic sir
loved the vedio
Is it possible to continue CP after work hrs ?? ;(
Discord link is showing invalid or expired, can someone plz share the working one
Guys I might sound silly but I really have this doubt. If I have multiple hash functions, while querying how do I know which one of those I used to hash the data to store it in my array in the first place? Cuz both the hash functions give different indexes.
Use both of them always. Compute both values and compare both of them. Ideally they both should be same!
I can't understand if we have arr=[1,2,3] we xor hash it and get 0 at index 2? It fails here as there are not 2 instances of every element behind? Pls explain.
thats why we shift by random value
🙏🙏🔥🔥
Happy New Year Vivek Bhaiya Thanks for this fantastic technique. Can you provide us with some problems so we can also apply these techniques and better understand the concept?