Binary Exponentiation : Iterative Method | CP Course | EP 54.2

[@Ankitkumar-gc5cc]

Thank you for this video, i had learned this from gfg yesterday only but i was not getting why there is n =n/2, which was basically right shift :-)

[@RaghavSharma-nt3hr]

Great content!! Amazing Explanation!! Don't know why or how I understand every concept explained in your video so quickly, compared to watching other DSA/CP videos on yt.

[@codethings271]

All your tutorials are best keep em coming

[@UserUser-tn8tv]

Thank you for this wonderful course. Please be consistent as you are because many of the students like me are totally dependent on your videos for competitive programming.

[@md_ashraf6455]

1st viewer. 1st commenter. You are the best KZbiner

[@bitwits363]

One word : GOLD

[@178fahimahmed7]

As Always , Awesome ❤❤❤

[@kathanvakharia]

Great one!

[@avinashgarg7894]

Thanku so much sir for this explanation. Thanku from Bihar

[@smartwork7098]

You are teaching amazingly!

[@pushpajitbiswas3752]

Adbhuut explanation, I really like it :)

[@harshitsingh4764]

best explanation 🔥

[@utkarshjha9087]

Hey, will you be covering topics like linked lists, DP, graphs etc as well?

[@iamluv]

dp and graphs , i will be covering. linked list no

[@Ayush479]

Nice explanation bhayiya

[@aryanjoshi8144]

this video help me a lot so thank you 🙏 😊

[@peeckle1657]

You are amazing man.

[@priyeshtandel2101]

Interest ++

[@shubhamagarwal2998]

🔥🔥🔥🔥🔥 ✨ Hard work op

[@aakashvishwakarma4653]

🤩🤩 Thank you 😊😊😊

[@Mahaveergautam]

Nice course

[@asishcodes]

What is the difference between >> and >>= ?

[@anniikeett]

latter one updates the value too (in the variable)

[@Ancientinsights002]

superb bro

[@mayurdas9738]

whenever you say log(n) complexity, does it mean that log n base 2 complexity? My question is what is the base in "log(n)" complexity

[@priteshchavan4580]

n/2

[@user-fs4yw5zh6o]

what if A is negative number ? or post applying bin exp the output is negative? The given solution wont work for A : -1 B : 1 M : 20

[@than0s869]

❤ nice bro

[@adiburrahman2207]

love you man

[@venkat.sairam]

but , when did we convert b to binary

[@tautikagrahari489]

thanks bhaiya, i will be getting into college this year....and so i had completed html css and javascript in class 12... i had started following your competitve programming playlist...and its awesome... Question: linked list is not for CP and for DSA for placement?

[@abhikantkumar8833]

Sath me coding karoge, mai isi year college me admission lunga Codecheif par mera (3★) hai 😐

[@tautikagrahari489]

@@abhikantkumar8833damn bro... Lets connect on instagram: dekh.liya

[@tautikagrahari489]

@@abhikantkumar8833 lets code together...i needed a coding budy

[@abhishekkanojia2816]

konse video editor se edit karte ho bhai?

[@shubham6215]

Thank you ❤️🙏

[@ananyapamde4514]

God bless you

[@sajeesyed3384]

great steps

[@sbhm_prksh03]

thanks buddy

[@samiulislamponik1534]

Thank you.

[@manoor0858]

for me the iterative approach was easier than recursive both were easy but iterative was sooooooooooooooooooooo easy

[@pranjalsingh3071]

Amazing

[@katw434]

thanks bro

[@chiraggoyal9646]

thanks bhaiya

[@epicspree6279]

first view

[@veerusingh1981]

Maja aa gaya bhiya

[@EasifywithPrakhar]

when you are saying log b it mean log(b) at base 2 ?? because generally logb is assumed as of base 10

[@g3488z]

The base of log is determined by how much the problem is getting divided in each step. If n/2 or n*2, it is log base 2. If n/7 or n*7, it is log base 7. So, log will have different base for different algorithms based on how we multiply/divide the input. It is not same as the assumption of maths to take base 10 always.

[@lakshyakhushalani9464]

link of ques in description of hackerearth is not working

[@iamluv]

hackerearth issues, cant do much

[@dishendradeshmukh59]

hackerearch ke practice question accessible nahi hai... anybody with same issue?

[@aashreykumar9886]

why are we doing mod

[@fayazansari2827]

Bhai dsa ke liye useful hai Playlist?

[@pranshul..]

🤔

[@FaisalKhan-oy4zz]

How the Time complexity will be O(log(b)) and not O(b) ? Plzz explain anyone!

[@iamluv]

because b is getting divided by 2 and while loop will run until b becomes 0, hence while loop will run log(b) times which is our time complexity

[@FaisalKhan-oy4zz]

@@iamluv thank you sir

[@devkumar9889]

Is long challenge me Binary exponention ka use tha 😶

[@SameerKumar-xy8ky]

💛💛💛

[@shivasaini4097]

❤️

[@vk8201]

❤️❤️

[@shady41]

I love you

[@SnehJoshi19]

Bloopers kha h ?

[@iamluv]

have stopped adding them

[@barnikroy5244]

Rukna mat bhaiya

[@codingwithsam4992]

in python just do this a^b%mod = pow(a,b,mod) LOL.

[@suharshsharma6764]

this code was giving tle lol

[@neetchannel8499]

video sponsered by "BALAJI EXCLUSIVE"

[@SumitShahB_]

Waha %M kyu aaya anyone