Zig Zag Array (spiral order array)

Поделиться
HTML-код
  • Опубликовано: 6 янв 2025

Комментарии •

  • @highschool017
    @highschool017 7 лет назад +13

    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 !!

  • @sahilarora1794
    @sahilarora1794 5 лет назад +3

    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!!

  • @ganeshjaggineni4097
    @ganeshjaggineni4097 7 месяцев назад

    NICE SUPER EXCELLENT MOTIVATED

  • @Thepankaz1
    @Thepankaz1 5 лет назад +2

    starts at 3:08

  • @jagginadivya3680
    @jagginadivya3680 5 лет назад +2

    The way u teaches is nyc

  • @vishalmahavratayajula9658
    @vishalmahavratayajula9658 4 года назад

    Very well explained. Keep it up

  • @ayushbhardwaj3296
    @ayushbhardwaj3296 4 года назад

    Thanks alot for your videos .

  • @tulu1688
    @tulu1688 7 лет назад +2

    Hi, what is the difference between "zig zag" array and "wave form" array?

  • @gurpreetsodi3948
    @gurpreetsodi3948 6 лет назад

    nyc algo...keep it up bro

  • @deepakbhargav7434
    @deepakbhargav7434 5 лет назад +1

    What is O(n)

  • @gyanprakash7680
    @gyanprakash7680 6 лет назад

    nice sir its too good !

  • @abhrakar3967
    @abhrakar3967 7 лет назад

    Very good, Sir.

  • @karankhanna9643
    @karankhanna9643 5 лет назад +1

    Why zig zag array is important

  • @srinithib5764
    @srinithib5764 4 года назад

    Thank you so much sir

  • @sarvodaykumar2723
    @sarvodaykumar2723 4 года назад

    Sort the array and swap a[i+1] = a[i+2] will this solve this problem

  • @JohnWick-zc5li
    @JohnWick-zc5li 7 лет назад

    very awasome-- pls code as well how about 2=2?

  • @xof8256
    @xof8256 5 лет назад

    Thank You

  • @ArjunKalidas
    @ArjunKalidas 5 лет назад

    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.

  • @yashpreetbathla4653
    @yashpreetbathla4653 4 года назад

    Thank you sir :)

  • @karan6551
    @karan6551 4 года назад

    ❤️❤️❤️❤️❤️

  • @ibrahimshaikh3642
    @ibrahimshaikh3642 4 года назад

    Nice

  • @ruchirsingh3635
    @ruchirsingh3635 7 лет назад

    and also make a video on fenwik tree or index binary tree

  • @ruchirsingh3635
    @ruchirsingh3635 7 лет назад

    sir make a video on segment tree

  • @tejaswiniravva795
    @tejaswiniravva795 5 лет назад

    Why u shouldn't provide the whole code With execution..??.. Explanation is gud but people need code for better understanding..

  • @kajalkansal2799
    @kajalkansal2799 6 лет назад

    Need video on longest oscillating subsequence

  • @SansaniKhabarlive
    @SansaniKhabarlive 3 года назад

    code bata do kisi ke paas ho to please

  • @deepakbhargav7434
    @deepakbhargav7434 5 лет назад

    Thank you