1404. Number of Steps to Reduce a Number in Binary Representation to One | Greedy

[@thesaggy21]

This is dsa channel I will not tell to my friends(competitive approach), I have been following this channel and its becoming my secret weapon which I wont disclose to anyone.

[@rajrajesh1669]

Meanwhile Aryan bro: 🙂 😂🤣

[@nptel1punith929]

you are underrated bro.. dont worry, people are gonna join and once they do they'll never leave you

[@kafuu1]

Nice to see you today

[@ajayc815]

Thanks you Bhai you are underrated !!

[@cenacr007]

Keep up the good work, your detailed explanations goes a long way in helping us to understand these questions❤

[@chandankumarnetha]

Tq bro

[@Andrey-ny2dv]

thanks, man. Clear as most of the times.

[@nanibramhasamudram6044]

Even If we simulate the process in worst case the time complexity still stays lesser than O(2n)

[@jhanavikumari274]

bhaii time laga but smajh me aagya

[@rachitkatariya]

Bro are you from Meerut?

[@dhruvkumartiwari8847]

i feel that you over exaggerate and explain simple things in a much harder way......... Just a personal opinion.

[@10minutes_cs]

Follow up Question: what if its not guaranteed that that you can always reach one for all test cases. How to modify our solution to fit this conditions.

[@NiteshKumar-do4en]

in constraint it is given that s[0] = '1'

[@10minutes_cs]

@@NiteshKumar-do4en ​ I am asking this as a follow up. what if follow up qustion in interview is this , how to modify our solution.