Fantastic explanation ! I request you to cover subsequence and subarray problems, like getting subsequences of array whose length is a power of 2 and find the maximum element in each subsequence or subarray such that the sum of those is maximum (For example).
If i learn a new ds or algo how many problem needs to solve? I learn and understand. I implement those for some of problem. Rest of the problem i doesn't know how to approach. How can i improve this?
As you said, lets say in fenwick tree, we did the following mapping: 10^9 -> 4, 10^10 -> 5. Lets assume their indices are such that we need to add them. So fenwick node will have 4+5 = 9 but this 9 could be absent in mapping. How yo retrieve actual value. This is confusing. I request you to explain probs supporting this concept. Thanks:)
Fantastic work bro... can u please tell the road map of solving questions on codechef/ codeforces to get a good grip of concpets for codechef/codeforces challenges.
Sir if I have all the values from 1 to 1e7 or more.. in my array... Would it be possible to use the same technique...If not then what would work fine??
@@kanishkkumar4746 bro linear kese kr loge thoda batana mjhe? Sort toh tumko aise v karna hi hoga aur wese v. Else kon bada h kon chota nai smjh aaega, sorting takes n log n, map and all ka nai bol rha hun, unordered_map or map jo man use kro,m that is different.
Very good initiative. One suggestion: provide links to some problems based on the idea.
Added an example to the description, check out.
Fantastic explanation ! I request you to cover subsequence and subarray problems, like getting subsequences of array whose length is a power of 2 and find the maximum element in each subsequence or subarray such that the sum of those is maximum (For example).
Just learned a new concept just before sleeping...wow thank you
Thanks for teaching this technique man!
Great video as always, thank you so much for sharing
Awesome video Raj Bhaiyya!! Looking forward to more such concepts
Thanks bro ..
I learned new things..
Glad that it helped in anyway, just a small request can you please share the channel among your groups/college/peers.
The problem in the description was a perfect introductory problem to this concept. Thanks !
Glad that it helped in anyway, just a small request can you please share the channel among your groups/college/peers.
bhaiya pls make a video on how to understand the execution of recursion
Keep uploading helps a alot 💕
Great Work bro :)
Awesome Explanation
If i learn a new ds or algo how many problem needs to solve? I learn and understand. I implement those for some of problem. Rest of the problem i doesn't know how to approach. How can i improve this?
Follow A2oj, go step-wise, please watch my video, raodmap to learn DSA, it is their in the starting page.
thanks. 😊
As you said, lets say in fenwick tree, we did the following mapping: 10^9 -> 4, 10^10 -> 5. Lets assume their indices are such that we need to add them. So fenwick node will have 4+5 = 9 but this 9 could be absent in mapping. How yo retrieve actual value. This is confusing.
I request you to explain probs supporting this concept. Thanks:)
Added an example to the description, check out.
I am not getting use of this technique because at last we are using map. Also sorting also giving O(nlogn) time.
Why can't we use the map to store the key and its frequency, do ++ whenever it is encountered again, and then retrieving frequency by key when we need
There are multiple ways of going to Mumbai from Kolkata, you can do one at a time :P
Really good technique
Fantastic work bro... can u please tell the road map of solving questions on codechef/ codeforces to get a good grip of concpets for codechef/codeforces challenges.
Upsolve
Is sorting necessary?
How to solve geometry's problem...plzz add some video on geometry...thnqq
Will do, since it is a new channel. Initially it will take time.
Sir if I have all the values from 1 to 1e7 or more.. in my array...
Would it be possible to use the same technique...If not then what would work fine??
Hey sorry for going irrelevant , how much hours did (you ) practice coding during your college days.
3/4 hours
@@takeUforward Thnx for your reply , is it per day ? What's the max that u did?
Is it important
Why one will use this shit in O(nlogn) time when we can do it in O(n) using map , any reason?
I think if you are not aware that map unordered_map at worst case takes o(N) and map at worst case takes o(n).
Why do not you make a video by yourself, if you feel this is shit. Learn to respect, it takes hours to record + edit.
@@takeUforward bhai wai to keh ra hu jab linear me kr skte h apan log fir Nlogn me kyu
@@takeUforward and i am not saying that u r doing shitty things , u r doing good but this algorithm as comapared to unordered_maps
@@kanishkkumar4746 bro linear kese kr loge thoda batana mjhe? Sort toh tumko aise v karna hi hoga aur wese v. Else kon bada h kon chota nai smjh aaega, sorting takes n log n, map and all ka nai bol rha hun, unordered_map or map jo man use kro,m that is different.