Zig Zag array is an array in which every element is less than and greater than the next element alternatively. Every element is either greater than or less than its neighbours.
Vivekanand Ji, u r an extraordinary teacher like your name !! Such simple n clear videos !! Thanx a lot for devoting your precious time for ppl like us !!
Thanks for Clear explanation! But there are two things which i feel is miswritten or wrongly spoken. 1- it should be a[i] > a[i+1] or less not i< i+1. We need to consider elements not indexes. 2- You talk about flipflop, flipflop never always toggles like this, they are just bistable multi vibrator, it should be instead a T Flipflop which is always given an input of 1. Anyway thnks for this video!!
Thank you very much for this video Vivekanand. Can you please post a video explaining the problem "find longest non-repeating subsequence in a string"? Thank you in advance.
Vivekanand Ji, u r an extraordinary teacher like your name !! Such simple n clear videos !! Thanx a lot for devoting your precious time for ppl like us !!
Thanks alot for your videos .
Thanks for Clear explanation!
But there are two things which i feel is miswritten or wrongly spoken.
1- it should be a[i] > a[i+1] or less not i< i+1. We need to consider elements not indexes.
2- You talk about flipflop, flipflop never always toggles like this, they are just bistable multi vibrator, it should be instead a T Flipflop which is always given an input of 1.
Anyway thnks for this video!!
Hi, what is the difference between "zig zag" array and "wave form" array?
Very well explained. Keep it up
nice sir its too good !
NICE SUPER EXCELLENT MOTIVATED
nyc algo...keep it up bro
Very good, Sir.
The way u teaches is nyc
very awasome-- pls code as well how about 2=2?
Thank you sir :)
Thank You
Thank you very much for this video Vivekanand. Can you please post a video explaining the problem "find longest non-repeating subsequence in a string"? Thank you in advance.
Thank you
What is O(n)
Thank you so much sir
Why zig zag array is important
starts at 3:08
and also make a video on fenwik tree or index binary tree
sir make a video on segment tree
Sort the array and swap a[i+1] = a[i+2] will this solve this problem
sorting takes o(nlogn) but this algorithm takes o(n)
Nice
❤️❤️❤️❤️❤️
Need video on longest oscillating subsequence
code bata do kisi ke paas ho to please
Why u shouldn't provide the whole code With execution..??.. Explanation is gud but people need code for better understanding..