We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
so that when the sliciing happens on list squares[i:i+m] , it does not go above the index limit.
as you can see i am doing i+m , while i is going from 0, to len()
In such case, you need to reduce the window.
This is known as Sliding window algorithm.
Birthday Chocolate
You are viewing a single comment's thread. Return to all comments →
One liner is always better, but i dont really like to compress the size, moreover this is more readable:
why is the range subtracted from len()+1?
so that when the sliciing happens on list squares[i:i+m] , it does not go above the index limit. as you can see i am doing i+m , while i is going from 0, to len() In such case, you need to reduce the window. This is known as Sliding window algorithm.