Also another way for finding condition is like this: If we are finding 3 consecutive equals, and we also know that last index of string is (N-1), then we know that i+2
I usually use i < length But when you have i+2 being checked, or whatever the biggest is, you can avoid rearranging altogether by simply using i + 2 < length If you like the ≤ operation, your right hand side can remain the same. I prefer modifying the RHS since it is clear what condition is leading us to our inequality.
Thanks for the video, all of them are very useful! It looks like now the time complexity is O(n*k) which is not so nice when k is too large. I think we can use in this problem sliding window of size k to have the time complexity O(n)
This is perfect and i think from this video alone i finally understand the logic behind the sort and search techniques. This video proved the need for me to buy a whiteboard and use some psudeocode whenever im doing loops. The reason being is because im trying to figure out how to test my loop the correct way to get the anwer i want. Doing the psudecode allows me to see what im doing at each postion.
Happy New Year @Errichto . Good to see you back. How are you doing?? Please keep uploading more videos, we all really missed your presence over RUclips! Thanks for such a grand come back! 😇 Also adding these sort of video which seems quite easy but require some amount of generalization and thinking logically how to generalize the problem will really be quite helpful for the beginners to think broader about the problem. Thanks!
Rather than saying i < n - 2, I find it more readable to say i + 2 < n. for (int i = 0; i + 2 < n; i++) { if (a[i] == a[i+1] and a[i] == a[i+2]) { return true; } }
That's a very good method! EDIT: The small disadvantage of "i + 2 < n" is that you can't use the same method to handle accessing a[i-1] and a[i-2]. You need to start with "int i = 2" so you anyway use my approach of thinking: what index should be considered first or last. Also, python for-loops require the upper limit instead of a condition. That being said, "i + 2 < n" or "i + k - 1 < n" is perfectly fine.
I follow a slightly different approach. I usually make sure that all access operations are within bound. For example, for s[i + 2] to be correct, we need to make sure that 0
Thanks for the informative video. Still, practice only makes the difference in understanding the boundaries. Solved all problems and found CSES Repetitions the most challenging. One comment here, I think it would be very nice to continue this lesson by describing of "sliding window" pattern. Cause all these problems match it.
I subscribed... Cause last time I came I forgot😅 I watched and went.. But now I am gonna implement... And I am gonna leave this comment here to make sure I keep doing what I said.. That is implementing what I learned.
We want a series that covers everything about your sheet in C++ such as these videos and takes us to a professional in competitive programming, please.
You need to understand early in your journey that there is no "course" for cp, it's all practice. Sure you can have some guidance on what and how to practice which errichto and many other people have already provided.
@@ITACHIUCHIHA-dr8sz Yes, I fully understand that experience comes with practice in solving problems, but we mean such videos that teach us how to errichto think so that we acquire that skill, thank you for your advice brother
Hi Errichto I am long time follower of yours. Please also make content for intermdiate level people. These beginner videos can get a lot of views but the beginners wont stick around your channel for very long. :)
Hi Errichto, thank you for the amazing video. A quick question, Wouldn't it be better to define an integer outside of the scope of the loop saying int z = n - k; Or const int z = n - 1; ? I remember some college teacher telling me/reading somewhere/have the feeling that I should always avoid letting operations inside the loop definition, since it will likely lead to performance issues. Also, other thing i remember reading about, is that, when possible, we should choose instead of = since the former performs only one operation and the later does two. In the example you showed us, I totally and understand the use of
Completely off topic, but can you tell me what program you were using for the notes at the beginning of the video? It looked like OneNote, but you are on ubuntu; unless it might be the electron version?
Hey, I am starting with my competetive programming journey with python (I know c++ is better but i am not planning on winning ICPC, i just want to have a strong CP background so it helps me with interviews and to just master python) and i cant really find any help on CP thats written in python. Like every tutorial is being learned in C++ and it kinda discouraged me from CP. Can you suggest any website, tutorial or anything that teaches python for CP. If you know of any you can also suggest some books but id prefer something online for now while im still a begginer although if there is a must have book for python than please let me know. Books or courses can also be in polish.
You should be fine if you can understand C++ code. Most tutorials are about algorithms and the implementation doesn't matter that much - it's there just to show some details.
This is very helpful! Can you tag some more practice problems for loops? I sometimes struggle with getting the loops correct in interview pressure. I see the problem you solved was category :( implementation + strings + 900). Are those the categories I should look for?
It is interesting, I use to program as s+i == s+i+1. Anyway, it is very dangerous to use s+i+something, you can easily go beyond of the array boundary.
My last Twitch live-stream was a month ago and it had similar difficulty. I want to cover some topics and problems from the "100 Easy Problems" training contest codeforces.com/blog/entry/97058 Don't worry, I will get back to non-easy topics eventually.
@@masternobody1896 you cant just jump into high level coding like making a game with having never coded before. That's like trying to do quantum physics and you don't even understand gravity. You need to start from the beginning and learn your way there. Ive taken 2 years of programming classes and I still don't know a lot.
I feel more comfortable with this, but here you have discussed "for loops" for this topic otherwise I always use "while loop". Is this called "block size technique" or something? for (int i = 0;i < N; ){ int counter = 0; char c = s[i]; for ( ;i < N && c==s[i];i++){ counter++; } if (counter >= k)return true; } return false; // Time: O(N)
Yes, that's it. Fors and whiles are very similar. It would be fine to just use a while-loop in your code. That being said, there is a more concise solution. One for-loop is enough. I will talk about it in the next video.
Strings are maybe not the best example here. The C++ standard says that accessing s[N] is legal for strings, as in not out-of-bounds, as it contains the NUL. (But don't dereference string.end() )
Hello, erricto sir. I do not understand how to determine the k value in CSES Repetitions. I am able to solve it in such a way. int n = s.size(); int ma = 0; for (int i = 0; i < n;) { int cnt = 0, j = i; while(s[i] == s[j]) cnt++, j++; i = j; ma = max (ma, cnt); } cout
We need more such tutorials on different topics. This was really helpful.
+1, more on different techniques / tricks / patterns!
+
Agree. Give us more :)
+++
I agree 300%
Also another way for finding condition is like this:
If we are finding 3 consecutive equals, and we also know that last index of string is (N-1), then we know that
i+2
You dont even need to rearrange.. We can leave the condition at i + 2 < n
@@abhishek.rathore you are right also by rearranging we are making it more complex in debugging, so we should avoid rearranging.
Errichto in AtCoder Hard : I am not going to explain this trivial dp optimisation
*Now randomly uploads how to use a for loop* 😂😂😂
Coming next: how to compile your code?
@@Errichto 😅
@@Errichto 😆 what's next? How to type?
Wow, after a long break he came back! Glad to see you back! Thank you!
I usually use
i < length
But when you have i+2 being checked, or whatever the biggest is, you can avoid rearranging altogether by simply using
i + 2 < length
If you like the ≤ operation, your right hand side can remain the same. I prefer modifying the RHS since it is clear what condition is leading us to our inequality.
Dude, you are so underrated!... your explanations are so good... love to see your videos.
This might be very basic but this formula helped me in many times. Number of elements in the interval [a,b] = b - a + 1. Where b >=a
Love the format of this video, where you do a very good explanation and leave homework with similar problems :D
Awesome lecture, please bring it up as a series where a beginner gets to hone thier algorithm and ds skills. Thanks
MAKE MORE LIKE THESE EVERYBODY LOVES THEM
Thanks for the video, all of them are very useful! It looks like now the time complexity is O(n*k) which is not so nice when k is too large. I think we can use in this problem sliding window of size k to have the time complexity O(n)
Yes, you're 100% correct.
Please keep making videos like this, great job!
Wow such awesome detailed explanation with questions. Please make more of these
I'd love to watch more. Thank you!
So good to see you are back @Errichto
This is perfect and i think from this video alone i finally understand the logic behind the sort and search techniques. This video proved the need for me to buy a whiteboard and use some psudeocode whenever im doing loops. The reason being is because im trying to figure out how to test my loop the correct way to get the anwer i want. Doing the psudecode allows me to see what im doing at each postion.
I prefer to use such construction:
for (int i=k; i
This is really helpful - especially when you dive into how you think about the problems and approach them. Thank you for sharing!
Happy New Year @Errichto . Good to see you back. How are you doing?? Please keep uploading more videos, we all really missed your presence over RUclips! Thanks for such a grand come back! 😇
Also adding these sort of video which seems quite easy but require some amount of generalization and thinking logically how to generalize the problem will really be quite helpful for the beginners to think broader about the problem. Thanks!
one of the best things today seeing you back errichto 😉☺
I couldn’t stop myself from liking this video
I really appreciate your work , you teach us how to think logically before the writing the codes .
Rather than saying i < n - 2, I find it more readable to say i + 2 < n.
for (int i = 0; i + 2 < n; i++) {
if (a[i] == a[i+1] and a[i] == a[i+2]) {
return true;
}
}
That's a very good method!
EDIT: The small disadvantage of "i + 2 < n" is that you can't use the same method to handle accessing a[i-1] and a[i-2]. You need to start with "int i = 2" so you anyway use my approach of thinking: what index should be considered first or last. Also, python for-loops require the upper limit instead of a condition. That being said, "i + 2 < n" or "i + k - 1 < n" is perfectly fine.
But it might have issues with overflow and hence undefined behavior
All work that float your boat ⛵
Yep, I was going to say exactly the same, I have been doing that for years.
@@icenberg5908 s[i+2] already depends that i + 2 is not overflowing.
Thank you so much for starting this series for beginners...
errichto need more things for beginners and intermediates, You are doing a great job Much love from INDIA.
too much prescious knowledge man! Thank you so so much!!
I really liked your style of explaining, I learned more about index and it's ranges. I already feel like a guru and I'm just a beginner 😆
im glad that the way we think are similar
You're the best man, thank you so much for making these videos
Imagine if Errichto had his own Algorithms Bootcamp .
It would be the best .
🔥
Love this....please carry out the good work...
Glad to see you back Errichto
It's good to see you back after some time..
Thanks for this video! I'm currtently working on improving my coding skills to become a better competitive programmer, this video helps a lot.
King is back
Glad to see you back
This was very well explained. Thank you!
Awesome Lecture. Please Keep it continue.
So glad to see you back
I follow a slightly different approach. I usually make sure that all access operations are within bound. For example, for s[i + 2] to be correct, we need to make sure that 0
When talking about generalization, the input may not be binary, so I think sliding window is a more general solution.
My code works for any string. The sliding window is indeed better though - because it's O(N) instead of O(N*K).
This is so useful! Thank you so much for making these videos!
a video after sooo long. finally
Thanks for the informative video. Still, practice only makes the difference in understanding the boundaries. Solved all problems and found CSES Repetitions the most challenging. One comment here, I think it would be very nice to continue this lesson by describing of "sliding window" pattern. Cause all these problems match it.
Loved the explanation!! Please can you create more of such basic but important methods of thinking or approaching a problem while coding videos ... !!
@Errichto thanks for a new video, it was weird that you disappeared for a month, I thought you were in a traveling competition😂
This is very helpful, thanks.
I am very happy to see you ❤️
Please more of this algo for beginners :)
U nailed the very basic but common problem to all age experience coders.
I subscribed... Cause last time I came I forgot😅 I watched and went.. But now I am gonna implement... And I am gonna leave this comment here to make sure I keep doing what I said.. That is implementing what I learned.
Great tutorials! Keep it up
Hey Errichto, I found your algo videos very easy to understand. Especially the ones on DP. Are you not making more videos on algo anymore?
We want a series that covers everything about your sheet in C++ such as these videos and takes us to a professional in competitive programming, please.
You need to understand early in your journey that there is no "course" for cp, it's all practice. Sure you can have some guidance on what and how to practice which errichto and many other people have already provided.
There is no such series, just go practice
@@ITACHIUCHIHA-dr8sz Yes, I fully understand that experience comes with practice in solving problems, but we mean such videos that teach us how to errichto think so that we acquire that skill, thank you for your advice brother
He recommended Competitive Programmer's Handbook, check this ruclips.net/video/xAeiXy8-9Y8/видео.html
@@ITACHIUCHIHA-dr8sz hi hitachi :)
Hello sir these type of video are really helpful can you make more of this
Instead of counting you could also have a flag initialized to true and &= it with the condition, then check if it stayed valid
We need more such. Love u
Waiting for more tutorial like these
Please continue this
long not see, my teacher
Errichto is back 🤩
Loved you content 🙌
Hi Errichto I am long time follower of yours. Please also make content for intermdiate level people. These beginner videos can get a lot of views but the beginners wont stick around your channel for very long. :)
Great video ! Keep up.
Great,thanks 👍☺️
Thank you so much sir.Can you make more tutorials like this...
Thank You sir !!
Hi Errichto, thank you for the amazing video. A quick question,
Wouldn't it be better to define an integer outside of the scope of the loop saying
int z = n - k;
Or
const int z = n - 1; ?
I remember some college teacher telling me/reading somewhere/have the feeling that I should always avoid letting operations inside the loop definition, since it will likely lead to performance issues. Also, other thing i remember reading about, is that, when possible, we should choose instead of = since the former performs only one operation and the later does two. In the example you showed us, I totally and understand the use of
Thank you!
Hey there errichto, is this a new series on your yt channel? This seems good to help those get into cp.
Please make a entire series of algorithms for beginners....high schooler like me needs it...please
Welcome back!
@Errichto need more videos from you.
(Where is your glass?)
Completely off topic, but can you tell me what program you were using for the notes at the beginning of the video? It looked like OneNote, but you are on ubuntu; unless it might be the electron version?
omg 10 mins ago i checked if ur back :D
Hey, I am starting with my competetive programming journey with python (I know c++ is better but i am not planning on winning ICPC, i just want to have a strong CP background so it helps me with interviews and to just master python) and i cant really find any help on CP thats written in python. Like every tutorial is being learned in C++ and it kinda discouraged me from CP. Can you suggest any website, tutorial or anything that teaches python for CP. If you know of any you can also suggest some books but id prefer something online for now while im still a begginer although if there is a must have book for python than please let me know. Books or courses can also be in polish.
"Data Structures and Algorithms in Python by Michael H. Goldwasser, Michael T. Goodrich, and Roberto Tamassia" is a nice book
You should be fine if you can understand C++ code. Most tutorials are about algorithms and the implementation doesn't matter that much - it's there just to show some details.
Long time back bro
This is very helpful! Can you tag some more practice problems for loops? I sometimes struggle with getting the loops correct in interview pressure.
I see the problem you solved was category :( implementation + strings + 900). Are those the categories I should look for?
Thanks man
It is interesting, I use to program as s+i == s+i+1. Anyway, it is very dangerous to use s+i+something, you can easily go beyond of the array boundary.
So Errichto finally reset his RUclips password. 🎊
I forgot I was even subbed to you
Why something like this suddenly? From dp and graph algorithms to for loops is a big leap😂😂
My last Twitch live-stream was a month ago and it had similar difficulty. I want to cover some topics and problems from the "100 Easy Problems" training contest codeforces.com/blog/entry/97058
Don't worry, I will get back to non-easy topics eventually.
@@Errichto how do you write code out of thin air do you have magic power or something?
@@Errichto I tried to make a snake game with never seen a code I could not do it. you can write it easily how do you do that? can you give us advice
@@masternobody1896 It's just like using English. If you know it well enough, you can type whatever you think.
@@masternobody1896 you cant just jump into high level coding like making a game with having never coded before. That's like trying to do quantum physics and you don't even understand gravity.
You need to start from the beginning and learn your way there. Ive taken 2 years of programming classes and I still don't know a lot.
Make some hard series on dp and graph,binary search ....we need it.
Want a DSA series 🙏
Never been so early 🔥
I feel more comfortable with this, but here you have discussed "for loops" for this topic otherwise I always use "while loop".
Is this called "block size technique" or something?
for (int i = 0;i < N; ){
int counter = 0;
char c = s[i];
for ( ;i < N && c==s[i];i++){
counter++;
}
if (counter >= k)return true;
}
return false;
// Time: O(N)
Yes, that's it.
Fors and whiles are very similar. It would be fine to just use a while-loop in your code.
That being said, there is a more concise solution. One for-loop is enough. I will talk about it in the next video.
@Errichto thanks for explicate problems easy
creo que es bueno para los que estan comensado, como yo 😂
Strings are maybe not the best example here. The C++ standard says that accessing s[N] is legal for strings, as in not out-of-bounds, as it contains the NUL. (But don't dereference string.end() )
Oh, you are right. Good point.
I always thought that string=vector and only arrays of chars have that 0-character at the end.
beautiful, thank you so much for sharing Errichto :)
I missed you a lot
Could you make lesson how to speed write decart tree.
moreee a series
😈Thanks
create a series on algorithms
@Errichto what is the name of the program in which you write something to write code?
Hey Errichto, have you been busy recently? Quite a hiatus.
Hello, erricto sir. I do not understand how to determine the k value in CSES Repetitions. I am able to solve it in such a way.
int n = s.size();
int ma = 0;
for (int i = 0; i < n;) {
int cnt = 0, j = i;
while(s[i] == s[j]) cnt++, j++;
i = j;
ma = max (ma, cnt);
}
cout
Yes, that's a correct solution for repetitions. Try to use it in CF Football now.
(I said that finding block size is an alternative solution)
Cool
Long time no see