I watched the binary search video and solved the problem you mentioned and more, and I will try to do that on this one again, and soon I will watch your dynamic programming series and solve them. Thank you so much for your guidance and I hope you upload more because they are great and straightforward
If you are really interested in learning and have some free time. You should watch videos (previously recorded livestream) from Colin galen and Vivek gupta.
0:00 What is prefix sums? 4:31 Problem 1 : Static range sum queries 7:09 Problem 2 : Most common character in the substring 15:41 Problem 3 : Array manipulation 🤯 18:49 Summary
Thank you for sharing this video! Your demonstration of the algorithm is amazing and straight forward with easy and hard problems, couldn't ask for a better video, thank you!
Thank you for posting educational content, I am really grateful and sure that most people appreciate your content so much too. please keep posting whenever you can, Thank you again!
@@Errichto Is it actually any better than using scanf() and printf()? I've done some testing myself and found that cin/cout with the boost are faster but I've also found conflicting results on the internet. What's your experience with the two approaches
I have a couple questions about CP, let's assume someone practices very hard until they reach IGM level on CF, after that, how many hours a week would be necessary to just maintain the acquired level? Would just participate in weekly contests be enough?
In the last problem can we just put a if statement that adds x if i is in range l to r please correct me if i am wrong And also as some one who just cp is a2oj a good resource or should i do something else also
If you do it separately for each of Q updates, the total time complexity is O(N*Q), which is too slow. a2oj is ok as long as you solve problems that are difficult enough for you.
Can you make a tutorial on problem solving. Like picking a harder problem and showing how to come up with some initial observations and ideas and work trough them to come up with a solution. A lot of times I just end up with a blank screen having difficulty even understanding what the problem is about.
I have hundreds of videos & streams about problem solving across my two channels. I rarely solve anything without explaining the thought process. If you want to see me struggle for hours, see any Atcoder Grand Contest streams like this one ruclips.net/video/UJrzgjblMCM/видео.html
Hello kindly hear guys , this is stay-at -home mum , Could I ask for C++, which laptop or computer required? Which one is best ? Which application or soft need to install ( now we use Mac) - thank you so much for your assistance.
why dont we just go through the range form a to b and up the elements instead of summing from 0 to b then from 0 to a and taking the prior minus the latter?
![Megan Thee Stallion - Bigger In Texas [Official Video]](http://i.ytimg.com/vi/QxTkZTLWdo4/mqdefault.jpg)
Long time no see
happy that you are back 🙂
please make videos continuously ,it helps a lot
Finally he is here👏👏
no way!!! i was looking for this video last week, but i saw you had not uploaded in a long time… what a nice timing. welcome back, errichto!🎉🎉
Finally Errichto remembers,
That he has a RUclips channel😅
Thanks for posting again! I really appreciate your videos. Your voice is calm and you're gifted in explaining it simply.
Greetings from Serbia.
Glad you're back!!!
Your lectures are fantastic, just the right amount of theoretical foundation and then a code dive-in, very well done, keep 'em coming Mr. Errichto!
We missed you so much
Errichto is back! ❤️
Finally you are back , i used to watch your videos when i eat food , finally again some great content . Love you man ....
He is backkk🎉🎉🎉🎉🎉🎉🎉🎉🎉🎉❤❤❤❤
He is back!🎉
I watched the binary search video and solved the problem you mentioned and more, and I will try to do that on this one again, and soon I will watch your dynamic programming series and solve them.
Thank you so much for your guidance and I hope you upload more because they are great and straightforward
If you are really interested in learning and have some free time. You should watch videos (previously recorded livestream) from Colin galen and Vivek gupta.
@@zanies6288 thank you so much for the recommendations, I really appreciate it and I will grind to solve and learn from them
Miss your content. I wish you come back.
Best wishes from India
The legend's back!
Errichto remembered his gmail password at last.
0:00 What is prefix sums?
4:31 Problem 1 : Static range sum queries
7:09 Problem 2 : Most common character in the substring
15:41 Problem 3 : Array manipulation 🤯
18:49 Summary
This should be on top!
Thank you so much errichto, i was just looking for prefix/suffix sums for the last few days
it's too time to see you again 🎉 I'm so happy ❤
happy to see that you are so back
The man himself is back at it again. Nice to have you back
Thank you for sharing this video! Your demonstration of the algorithm is amazing and straight forward with easy and hard problems, couldn't ask for a better video, thank you!
still haven't studied 2d prefix sum because i've been waiting for your video
Welcome back, glad to see u posting again
Finally he is back after a long time 😊.
the way you teach is perfect
man im so happy you are back!
Heyyy, very nice to see you back. I've learnt so many stuffs from you
Thank you for posting educational content, I am really grateful and sure that most people appreciate your content so much too.
please keep posting whenever you can, Thank you again!
welcome bruh I'm happy to see you long time no see
Legend comes🎉🎉🎉
Good to see u back😊
Loved to see your content once again. Thanks you so much.
wow you are back! we missed you bro
Does anyone know what does:
*ios_base::sync_with_stdio(0);*
and
*cin.tie(0);*
mean?
In short, it makes cin/cout faster.
@@Errichto Is it actually any better than using scanf() and printf()? I've done some testing myself and found that cin/cout with the boost are faster but I've also found conflicting results on the internet. What's your experience with the two approaches
@@therealpancake7140 streams work with std::string, which makes them easier to use.
Glad to see you're back🤩
The chosen one is back
Thanks for the video! That type of content I find the most useful.
I'm glad to see you again
The myth the man the legend.
The legend is back guys.❤❤❤❤❤❤
Welcome back man 🔥🤜
I have a couple questions about CP, let's assume someone practices very hard until they reach IGM level on CF, after that, how many hours a week would be necessary to just maintain the acquired level? Would just participate in weekly contests be enough?
Love your videos, was hoping you would post again soon :)
After long time!
LET'S GOOOOOO! LOOK WHO'S HEREEE
Excellent that you get back....¡¡¡¡¡¡
YAY! ERRICHTO'S BACK!
very happy to see you 😊❤
Thanks for the fantastic content!🌻
Keep on teach us erricto.🔥🔥
Finally,,,, After A Long Time❤
In the last problem can we just put a if statement that adds x if i is in range l to r please correct me if i am wrong
And also as some one who just cp is a2oj a good resource or should i do something else also
If you do it separately for each of Q updates, the total time complexity is O(N*Q), which is too slow.
a2oj is ok as long as you solve problems that are difficult enough for you.
@@Errichto Thank you very much for your guidance 👍😊
Legends never die!🙂
Thank you so muuch for all of this!!❤
Top G is back 😌
Pls make some more videos like this
Thank you
The best tutor
After a long time.
What's the device that you are using to write in screen ?
Can you please answer.
I guess you will be uploading about algorithms now that's gonna be good
Good day Errichto! I have question. ( 10:00 )
at the 7 line :
s is string
s.length() = s.size() ?
Yeah same thing
Finally!!! I missed you😅
Where did you set pref[0] = 0. Sorry if it is stupid to ask!
yeah same request : Please make more videos :)
Brother can you recommend me which book r best for DSA and competative programming. Ik practice is the key but please recommend me 😊
Will you be posting regularly?
He man thanks please be regular
hello errichto i am currently on a search for a new laptop for CP and i wanted to know if you got any advices for choosing the right one?
doesn't it better if we store our a[I] 's starting from 1. I mean skip 0 th index and store them in the array starting from the 1st index
Can you make a tutorial on problem solving. Like picking a harder problem and showing how to come up with some initial observations and ideas and work trough them to come up with a solution. A lot of times I just end up with a blank screen having difficulty even understanding what the problem is about.
I have hundreds of videos & streams about problem solving across my two channels. I rarely solve anything without explaining the thought process. If you want to see me struggle for hours, see any Atcoder Grand Contest streams like this one ruclips.net/video/UJrzgjblMCM/видео.html
@@Errichto This is it. Thank you.
long time no see😂
Does this method work for suffix as well , where we use an array of size + 1? I ran into some errors
Hello kindly hear guys , this is stay-at -home mum , Could I ask for C++, which laptop or computer required? Which one is best ? Which application or soft need to install ( now we use Mac) - thank you so much for your assistance.
Good-hearted guys
@aisha9763, I don't use mac but hope this helps ruclips.net/video/1E_kBSka_ec/видео.htmlsi=H77gcqle7X-EVWOy
sir please made a video for setup far manager
why dont we just go through the range form a to b and up the elements
instead of summing from 0 to b then from 0 to a and taking the prior minus the latter?
Hi from Banja Luka
can i ask hint to hackerrank problem?
I love this video
Long time no see
polska gurom
raxmat bro
first problem is basically what integral images are about.
Finally 😍😍😍
More videos please
More edu videos please
still waiting for 2d prefix sums :(
It's been a while 😭
more videoss please
Do you still do tutoring?
I do. You can find my email id in the "About" section on RUclips.
✨💫
3 views 13 likes!
😶🌫️✨
Eat burger
dawaj tyeraz po polsku
Can this comment get pinned?
the legend is back!