WIGGLE SORT | Leetcode | Simplified Solution

[@arvisingaravelou3811]

Is return should be mid or nums[mid]? I see as per logic the wiggle sort must return mid. Correct me if I'm wrong?

[@Niranjan-dt2mc]

Thank you so much for all your videos on data Structure and algorithm programs 🙏..it helped me to improve my skills on data Structure and algorithm

[@jatinthakwani5370]

You are taking extra space which is not allowed on leetcode for this question

[@jeevapriya4853]

Mam also plz make videos on shortcut trick to develop a logic for coding .... I too tried a lot of problems bt I couldn't able to get the crt logic mam .... bt somewhat I improved on seeing ur videos mam .... it's very helpful for me

[@Niranjan-dt2mc]

Please make more videos on graph 🙏

[@nETSETOStECH]

Sure

[@pranabsaha626]

But this is not O(1) space.

[@lifeoflearner4921]

Even merge and bubble too

[@nETSETOStECH]

We have covered Merge sort...Have a look kzbin.info/www/bejne/jaaQpphsfrGGoaM

[@lifeoflearner4921]

How to connect with you?

[@kalpanagupta6166]

If numbers are not duplicate, you need not to sort it.

[@lifeoflearner4921]

Please make maam all sorting algorithm in python

[@nETSETOStECH]

ok,Sure

[@lifeoflearner4921]

@@nETSETOStECH yes please i too have a channel of codes with name tech with codes

[@lifeoflearner4921]

@@nETSETOStECH but your videos i watch daily so please make such videos

[@lifeoflearner4921]

Please consider my request