Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
thanks for explanation
thanks for the solution i solved the question in one go
I used a queue to store the indices of the fliped answer and whenever the queue size is greater than k I pop out the first element.
Thanks, bro!
you are good bro!
Good Explanation!!
Glad it was helpful!
how use calculate i-l+1?.. can you explain
With due respect this solution does not work for test case number 70 in leetcode
nice explanation!
Glad you liked it!. Share with your friends also👍
Thanks!!
Welcome 😀
Cant we use stack in this question?
thanks for explanation
thanks for the solution i solved the question in one go
I used a queue to store the indices of the fliped answer and whenever the queue size is greater than k I pop out the first element.
Thanks, bro!
you are good bro!
Good Explanation!!
Glad it was helpful!
how use calculate i-l+1?.. can you explain
With due respect this solution does not work for test case number 70 in leetcode
nice explanation!
Glad you liked it!. Share with your friends also👍
Thanks!!
Welcome 😀
Cant we use stack in this question?