Modular Exponentiation Explained with Code🔥

In this video, you will be learning about modular exponentiation which is a very common topic while solving DSA problems.
Link to all codes:
Brute Force Solution Code-
https://github.com/killer4639/Competitve-Programming/blob/main/modular_exponentiation_O(y).cpp

Optimised Recursive Solution Code-
https://github.com/killer4639/Competitve-Programming/blob/main/modular_exponentiation_recursive_O(logy).cpp

Optimised Iterative Solution Code -
https://github.com/killer4639/Competitve-Programming/blob/main/modular_exponentiation_iterative_O(logy).cpp

Refer to this blog if you want to read more on this topic:
https://cp-algorithms.com/algebra/binary-exp.html

------------------------------------------------------------------------------------------------------------------------
Registration for Newton School's Full Stack Course 2022 - https://bit.ly/FullStack2022
Newton School Official WhatsApp Support Number: +91 6362 331 200
------------------------------------------------------------------------------------------------------------------------
============================================================
Do visit Newton school through: https://www.newtonschool.co/

Subscribe | Like | Comment

Follow Newton school on:
Facebook: https://www.facebook.com/newtonschool.co
Instagram: https://www.instagram.com/newtonschoolofficial/
Linkedin: https://www.linkedin.com/school/newtonschool/



Link to my Social handles-
https://www.linkedin.com/in/shiva-gupta-1843b6170/
https://github.com/killer4639
https://twitter.com/ShivaGupta4639

TIMESTAMPS
00:00 Introduction
01:32 Brute Force Solution
04:05 Optimised Recursive Solution
08:22 Optimised Iterative Solution












#competitiveprogramming #dsa #algorithm