I would like you to make a video on how to prepare for competetive programming. You are doing an awesome job. Once I am good at it. I'll definitely help the community.
Gaurav, with all respect for this good content, it's really disappointing to see so many ads in the video. Ad in every 3-5 mins! What's going on? It's already hard to concentrate on such topic and ad every every 3-4 mins just disturbs the flow. Really disappointing.
Sir could you please tell me how should I manage my time between competitive programming and software development( machine learning and neural networks, web, app dev etc). I have interest in both and in the end only SD is going to help me in solving real world problems. But, Competitive is going to improve my Logical and thinking skills and improve my problem solving. I am currently is third semester and confused between the two..please help.
Wow, it really has been 3 years. I divided by time as CP: 25% , Algorithms DS: 50% Side projects, CS subjects: 25% This worked out really well for me and I got a good internship opportunity and PPO from on campus placements. For off campus, I suggest to focus more on CP
@@azurnxo2134CP would be practicing on codechef etc., Algos DS would be preparing interview type questions. Yeah work on these things and ensure you keep trying diff companies till you get a good job. Don't settle for less
Hello Gaurav thanks a lot that you are taking efforts on such a videos. They are really helpful for us. In the this video At 33.53 you are saying to make a person dead that is making 1 to 0 right? But what if the bit at a given index is already zero? Then it is better to first apply ORing 1 and then XORing again with 1 so that 0 remains zero and 1 becomes 0. Right? Another thing is, in competitions on Hackerrank, Hackerearth there are 6 problems first 2 are easy level but from 3 onwards problems are of medium, hard and expert level. So I request you to take such more examples and explain the approach to solve them. It will be really helpful for us. Thanks.😊
@Gaurav Sen Sir, can't we traverse the array and check whether the person is alive or dead. Does in this case bit manipulation will give a better time complexity?
I use java in competitive programming and I am coding since last two years...So it would be great if you show how to save space while declaring arrays of large size like 10^5 elements......And I also want to learn problem solving based on graphs....Thank you :)
Another awesome video, before appreciating bitwise manipulations, i should appreciate you, and i'm keenly looking forward for more videos and if possible please share solution video for august long challenge chef and fibonacci array. Thanks in advance :D
Hi Sagar! Most of this has been through participating in contests and interviewing people. But some of this is very recent: I get a video request, prepare on the topic, and then make one :-)
omg i was solving a problem on codechef which i thought was based on bit manipulation and thinking to check any tutorial for bit manipulation and i see your video.
Hi bro. Great Work. Your videos are easy to understand. They make themselves understood automatically :D (True. Not an exaggeration ) I would like to ask for some more :P .. A video on Pollard Rho should be cool. Not many sensible tutorials online. Would be great if you can actually post a video on Pollard Rho and its variants. Thanks once again.
Thanks Venkata! Pollard Rho was used in a contest I had participated in, and I didn't know about the technique then. Would be fun to make a video on this topic! Thanks for the suggestion :-)
Mr. L Sir could you please tell me how should I manage my time between competitive programming and software development( machine learning and neural networks). I have interest in both and in the end only SD is going to help me in solving real world problems. But, Competitive is going to improve my Logical and thinking skills and improve my problem solving. I am currently is third semester and confused between the two..please help.
@@gkcs If I'm wrong with my question please explain that overflow optimization method, please.! It means that I didn't understand that part completely.:(
28:58 6 should be written in the binary instead of 7. 011 should have been added to the first bits of binary[2]
I would like you to make a video on how to prepare for competetive programming.
You are doing an awesome job.
Once I am good at it. I'll definitely help the community.
Thats great Varun! Go ahead and best of luck! :-D
After watching the video I easily understood Bitwise Manipulation. Thanks bro. 🇧🇩
13:39 Could have skipped rubbing the zero, this is what happens when we think of efficiency at each step. Loving it, but got 4 ads in 12 minutes. :)
"It requires 10, 000 bits which no sensible language contains."
I worship the snake.
Haha. Yes, Python takes care of many things :-)
😁
9:00 we can use log of that number+1
Gaurav, with all respect for this good content, it's really disappointing to see so many ads in the video. Ad in every 3-5 mins! What's going on? It's already hard to concentrate on such topic and ad every every 3-4 mins just disturbs the flow. Really disappointing.
I guess RUclips put too many in your view. Hard luck :-/
This is how minecraft bedrock stores its chunk pallet keys that map to the nbt pallet.
4:47 , should be 7 3 6 8
please make video on *How to generate all the possible subsets of a set ?*
That's a good suggestion, thanks!
Yes, using bit masking, and also a video on hamiltonian cycle and path.
can you please talk about the various uses of prefix sum logic and how can we understand when to use this tool of prefix sum.. Thanks in advance !
Sir could you please tell me how should I manage my time between competitive programming and software development( machine learning and neural networks, web, app dev etc). I have interest in both and in the end only SD is going to help me in solving real world problems. But, Competitive is going to improve my Logical and thinking skills and improve my problem solving. I am currently is third semester and confused between the two..please help.
Did you find some way out buddy? It's been an year, maybe you could help :)
Wow, it really has been 3 years.
I divided by time as CP: 25% ,
Algorithms DS: 50%
Side projects, CS subjects: 25%
This worked out really well for me and I got a good internship opportunity and PPO from on campus placements.
For off campus, I suggest to focus more on CP
@@azurnxo2134CP would be practicing on codechef etc., Algos DS would be preparing interview type questions.
Yeah work on these things and ensure you keep trying diff companies till you get a good job. Don't settle for less
@@azurnxo2134 Can't explain.
Try out questions on CP platforms , read interview exp you"ll learn
your lectures are awesome man !! thanks
Prabhu ki jai ho
Aaj samaj aaya kaise "analyse karte hai bit manipulation ke sawal"
Now its easier to do computer networks
Please make some video tutorials on bitmasking+dp with medium level example not easy level
Thats coming out next!
Hello Gaurav thanks a lot that you are taking efforts on such a videos. They are really helpful for us. In the this video At 33.53 you are saying to make a person dead that is making 1 to 0 right? But what if the bit at a given index is already zero? Then it is better to first apply ORing 1 and then XORing again with 1 so that 0 remains zero and 1 becomes 0. Right?
Another thing is, in competitions on Hackerrank, Hackerearth there are 6 problems first 2 are easy level but from 3 onwards problems are of medium, hard and expert level. So I request you to take such more examples and explain the approach to solve them. It will be really helpful for us.
Thanks.😊
Sure Anand, will keep that in mind :)
we can check whether its 0 or 1 for checking its alive? confusion
what is the data type of binary_value here ?
@Gaurav Sen
Sir, can't we traverse the array and check whether the person is alive or dead. Does in this case bit manipulation will give a better time complexity?
Yes, it's O(1) vs. O(N). Traversing the array isn't feasible for some situations 🙂
@@gkcs thank you so much
Please make some more videos on bit manipulation...
Hi Bhushan! Anything that you want to learn about bit manipulation in particular? I tried to put in the most common use cases in this video. :-)
I use java in competitive programming and I am coding since last two years...So it would be great if you show how to save space while declaring arrays of large size like 10^5 elements......And I also want to learn problem solving based on graphs....Thank you :)
Another awesome video, before appreciating bitwise manipulations, i should appreciate you, and i'm keenly looking forward for more videos and if possible please share solution video for august long challenge chef and fibonacci array. Thanks in advance :D
Thanks madhav!
Gaurav is like... This is very interesting,let say you wanna kill the person 11. And the smile 😂😂😂🙏
can you please make a video on how to calculate time complexity
(consider python as example)
I have already made one on the channel :)
why not to just write 2^n = 8? It'd be much faster.
n = log(8)/log(2) is much more faster
Great work, I just wanted to ask where did you learned all these, i.e. some online resource ?? Thanks
Hi Sagar!
Most of this has been through participating in contests and interviewing people. But some of this is very recent: I get a video request, prepare on the topic, and then make one :-)
data type goes into negative values means?
Yes, if there is an overflow or done purposely.
@@gkcs happy holi
n = log(number + 1)/log(2) = log(8)/log(2) is much more faster. You might need to do a Math.Ceiling(log(8)/log(2))
omg i was solving a problem on codechef which i thought was based on bit manipulation and thinking to check any tutorial for bit manipulation and i see your video.
Haha. Coincidence :-P
could you add subtitle in English, please? I don't understand well
if anyone can suggest some related problems it would be really helpful... i would be able to apply all these. thanks in advance.
are you friends with cs dojo?
+Daniel Ro I had a chat with him on Competitive Programming some time back, and found him to be passionate about teaching :-)
do you think in a technical interview it is worth trying to do bitwise optimization? or should we just stick to standard optimization methods.
+Daniel Ro The standard ones are usually enough. This is a little specific to competitive programming.
what are those standard optimization methods?? if anyone can list them plz.
@@gkcs what are the standard optimization method ???
Hola!! saludos desde Bolivia porfavor
habria alguna posibilidad de que en su video tenga traduccion en español?? como subtitulo gracias!!
Hi bro. Great Work. Your videos are easy to understand. They make themselves understood automatically :D (True. Not an exaggeration ) I would like to ask for some more :P .. A video on Pollard Rho should be cool. Not many sensible tutorials online. Would be great if you can actually post a video on Pollard Rho and its variants.
Thanks once again.
Thanks Venkata! Pollard Rho was used in a contest I had participated in, and I didn't know about the technique then. Would be fun to make a video on this topic! Thanks for the suggestion :-)
Yeah I don't even know my binary values... LoL you are cool man!!
Mr. L
Sir could you please tell me how should I manage my time between competitive programming and software development( machine learning and neural networks). I have interest in both and in the end only SD is going to help me in solving real world problems. But, Competitive is going to improve my Logical and thinking skills and improve my problem solving. I am currently is third semester and confused between the two..please help.
@@mr.l3260 how are you doing now ?
@@amanraj1608 I decided not to study Machine learning! PHd maths students will always be ahead of us in that field.
Which college bro
real good vids !! keep em coming
Thanks Sanket!
This is awesome!!!!
Thanks sir
so on so forth!
nice dude
111 (|)BINARY_OR of 011 gives you 111! How did you get 1111?
Timestamp 😋
@@gkcs 20:30
@@gkcs After the part where you said to use OR operator instead of ADDITION operator to overcome the overflow.
@@balajisv4052 Please watch the video carefully. The overflow is clearly mentioned, after mentioning the shifting of 3 by 3 bits.
@@gkcs If I'm wrong with my question please explain that overflow optimization method, please.! It means that I didn't understand that part completely.:(
Thanks (:
:-)