On problem E I missed the first line "You are given an undirected graph consisting of n vertices and n edges". I kept trying to solve the problem for a general graph and was thinking "why is this so much harder than F". Thanks for the stream I think you can skip the binary search on F by just increasing the size of whichever outer range has the smaller max.
How many years have you been coding? I started learning html and javascript for web development and python for back-end. Any tips you could give me that would help me develop my skills more effectively?
can you please make a video explaining the concept of the below problem: You are given an array of size N and you have to find the number of pairs whose bitwise OR is equal to X. There are q number of queries and in each query, X is given. Constraints : 1
C didn't require special knowledge, just being careful, you should be able to get that. D requires knowing about prime factorization, E requires knowing some graph theory, and F requires knowing about RMQ or segment tree. So whether you should get those just depends on how much experience you have.
@@bl4ck21 It takes a bit of time for video processing in TH-cam. Wait a bit and youtube will automatically allow high quality after processing is done.
When your so fast at typing that your typing speed is faster than the syntax highlighting
1:03:44 you don't necessarily have to distribute 3's and 5's and multiply to 2's , you can always multiply last 2 with remaining factors .
Thank you for the explanations, especially E!!
amazed to see how fast you solved A!!
good morning to you too.. nice to see you. again.
On problem E I missed the first line "You are given an undirected graph consisting of n vertices and n edges". I kept trying to solve the problem for a general graph and was thinking "why is this so much harder than F". Thanks for the stream
I think you can skip the binary search on F by just increasing the size of whichever outer range has the smaller max.
I think it would make you get TLE
You're the best I from mexico
Loved your videos
It would have been helpful if you have posted the link for your submissions or code.
Codeforces : is it rated?
TH-cam : why only 360p?
in process....
Any chance you could share your setup details? Like which graphics tablet you use for making your vids?
now i see you changed your legendary sort function, wonder what was the reason for that xD
How many years have you been coding? I started learning html and javascript for web development and python for back-end. Any tips you could give me that would help me develop my skills more effectively?
can you please make a video explaining the concept of the below problem:
You are given an array of size N and you have to find the number of pairs whose bitwise OR is equal to X. There are q number of queries and in each query, X is given.
Constraints :
1
gg man keep it up
Thanks
Which computer specs you used and which company phone you have ??
What set solve means here ?
Hey David, can you make a video on your journey to competitive programming and which resources did you use for learning dsa
Thanks
why in 360p :(
TH-cam still processing, they will fix it in a bit...
@@SecondThread Yeah, the quality's gone up now. Congratulations for today's performance too! :)
I solved only A and B, as a begineer , is it good??
Depends on how old you are.
In age or time coding started??
C didn't require special knowledge, just being careful, you should be able to get that. D requires knowing about prime factorization, E requires knowing some graph theory, and F requires knowing about RMQ or segment tree. So whether you should get those just depends on how much experience you have.
Subtreeses
No views•Nov 24, 2020
first comment
i am first
I am Second (Thread)
quality is really baaad
true
Wait for youtube to process man
@@bl4ck21 It takes a bit of time for video processing in TH-cam. Wait a bit and youtube will automatically allow high quality after processing is done.
How is your FACEBOOK job going?